./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_product52.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_product52.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 e4fc698cb41b54b4c4983dda7de32b2f9c78701d9e96fbbf9a36472a5bdbde25 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:00:30,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:00:30,354 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:30,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:00:30,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:00:30,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:00:30,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:00:30,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:00:30,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:00:30,390 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:00:30,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:00:30,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:00:30,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:00:30,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:00:30,423 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:00:30,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:00:30,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:00:30,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:00:30,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:00:30,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:00:30,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:00:30,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:00:30,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:00:30,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:00:30,426 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:00:30,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:00:30,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:00:30,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:00:30,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:00:30,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:00:30,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:00:30,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:00:30,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:00:30,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:00:30,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:00:30,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:00:30,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:00:30,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:00:30,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:00:30,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:00:30,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:00:30,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:00:30,430 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 -> e4fc698cb41b54b4c4983dda7de32b2f9c78701d9e96fbbf9a36472a5bdbde25 [2024-10-11 03:00:30,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:00:30,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:00:30,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:00:30,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:00:30,663 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:00:30,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product52.cil.c [2024-10-11 03:00:32,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:00:32,238 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:00:32,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product52.cil.c [2024-10-11 03:00:32,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/50ca12b1b/e85a1693b33c4991934ee85020e1222c/FLAG2c31c48cd [2024-10-11 03:00:32,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/50ca12b1b/e85a1693b33c4991934ee85020e1222c [2024-10-11 03:00:32,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:00:32,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:00:32,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:00:32,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:00:32,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:00:32,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:00:32" (1/1) ... [2024-10-11 03:00:32,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52351084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:32, skipping insertion in model container [2024-10-11 03:00:32,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:00:32" (1/1) ... [2024-10-11 03:00:32,320 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:00:32,582 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_product52.cil.c[18431,18444] [2024-10-11 03:00:32,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:00:32,598 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:00:32,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-10-11 03:00:32,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [160] [2024-10-11 03:00:32,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [388] [2024-10-11 03:00:32,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [458] [2024-10-11 03:00:32,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [824] [2024-10-11 03:00:32,607 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [923] [2024-10-11 03:00:32,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [958] [2024-10-11 03:00:32,608 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [967] [2024-10-11 03:00:32,646 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_product52.cil.c[18431,18444] [2024-10-11 03:00:32,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:00:32,666 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:00:32,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:32 WrapperNode [2024-10-11 03:00:32,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:00:32,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:00:32,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:00:32,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:00:32,674 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:32" (1/1) ... [2024-10-11 03:00:32,690 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:32" (1/1) ... [2024-10-11 03:00:32,713 INFO L138 Inliner]: procedures = 57, calls = 101, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 210 [2024-10-11 03:00:32,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:00:32,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:00:32,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:00:32,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:00:32,723 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:32" (1/1) ... [2024-10-11 03:00:32,724 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:32" (1/1) ... [2024-10-11 03:00:32,730 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:32" (1/1) ... [2024-10-11 03:00:32,744 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:32,745 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:32" (1/1) ... [2024-10-11 03:00:32,745 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:32" (1/1) ... [2024-10-11 03:00:32,748 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:32" (1/1) ... [2024-10-11 03:00:32,752 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:32" (1/1) ... [2024-10-11 03:00:32,753 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:32" (1/1) ... [2024-10-11 03:00:32,754 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:32" (1/1) ... [2024-10-11 03:00:32,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:00:32,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:00:32,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:00:32,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:00:32,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:32" (1/1) ... [2024-10-11 03:00:32,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:00:32,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:32,790 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:32,793 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:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:00:32,827 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 03:00:32,827 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 03:00:32,828 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 03:00:32,828 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 03:00:32,828 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 03:00:32,828 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 03:00:32,828 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:32,828 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:32,828 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 03:00:32,828 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 03:00:32,828 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-11 03:00:32,829 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-11 03:00:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:00:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 03:00:32,829 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 03:00:32,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:00:32,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:00:32,907 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:00:32,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:00:33,268 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-10-11 03:00:33,268 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:00:33,375 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:00:33,379 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 03:00:33,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:33 BoogieIcfgContainer [2024-10-11 03:00:33,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:00:33,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:00:33,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:00:33,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:00:33,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:00:32" (1/3) ... [2024-10-11 03:00:33,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2649d569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:00:33, skipping insertion in model container [2024-10-11 03:00:33,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:00:32" (2/3) ... [2024-10-11 03:00:33,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2649d569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:00:33, skipping insertion in model container [2024-10-11 03:00:33,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:00:33" (3/3) ... [2024-10-11 03:00:33,394 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product52.cil.c [2024-10-11 03:00:33,409 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:00:33,409 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:00:33,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:00:33,496 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;@22becc0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:00:33,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:00:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 48 states have (on average 1.5625) internal successors, (75), 57 states have internal predecessors, (75), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 03:00:33,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 03:00:33,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:33,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:33,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:33,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 84840355, now seen corresponding path program 1 times [2024-10-11 03:00:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:33,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370079022] [2024-10-11 03:00:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:33,886 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:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:33,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370079022] [2024-10-11 03:00:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370079022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:33,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:00:33,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65356960] [2024-10-11 03:00:33,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:33,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 03:00:33,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 03:00:33,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 03:00:33,946 INFO L87 Difference]: Start difference. First operand has 69 states, 48 states have (on average 1.5625) internal successors, (75), 57 states have internal predecessors, (75), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 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:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:34,051 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions. [2024-10-11 03:00:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 03:00:34,057 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:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:34,069 INFO L225 Difference]: With dead ends: 136 [2024-10-11 03:00:34,073 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 03:00:34,081 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:34,086 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:34,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 03:00:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 03:00:34,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 53 states have internal predecessors, (65), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 03:00:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2024-10-11 03:00:34,163 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 12 [2024-10-11 03:00:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:34,169 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2024-10-11 03:00:34,169 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:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-10-11 03:00:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 03:00:34,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:34,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:34,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:00:34,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:34,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1383562372, now seen corresponding path program 1 times [2024-10-11 03:00:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:34,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401067282] [2024-10-11 03:00:34,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:34,355 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:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:34,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401067282] [2024-10-11 03:00:34,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401067282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:34,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:34,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66760186] [2024-10-11 03:00:34,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:34,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:34,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:34,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:34,363 INFO L87 Difference]: Start difference. First operand 64 states and 88 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:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:34,465 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2024-10-11 03:00:34,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:34,466 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:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:34,467 INFO L225 Difference]: With dead ends: 98 [2024-10-11 03:00:34,467 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 03:00:34,468 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:34,469 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:34,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 112 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 03:00:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 03:00:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.475) internal successors, (59), 48 states have internal predecessors, (59), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 03:00:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-10-11 03:00:34,503 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 13 [2024-10-11 03:00:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:34,505 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-10-11 03:00:34,505 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:34,506 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-10-11 03:00:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 03:00:34,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:34,506 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:34,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:00:34,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:34,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -181124471, now seen corresponding path program 1 times [2024-10-11 03:00:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:34,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168981960] [2024-10-11 03:00:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:34,625 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:34,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:34,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168981960] [2024-10-11 03:00:34,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168981960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:34,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:34,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892887048] [2024-10-11 03:00:34,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:34,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:00:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:34,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:00:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:00:34,630 INFO L87 Difference]: Start difference. First operand 56 states and 77 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:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:34,761 INFO L93 Difference]: Finished difference Result 164 states and 228 transitions. [2024-10-11 03:00:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:00:34,761 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:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:34,763 INFO L225 Difference]: With dead ends: 164 [2024-10-11 03:00:34,763 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 03:00:34,764 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:34,764 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 71 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:34,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 131 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 03:00:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-10-11 03:00:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.486842105263158) internal successors, (113), 91 states have internal predecessors, (113), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 11 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 03:00:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-10-11 03:00:34,791 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 16 [2024-10-11 03:00:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:34,792 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-10-11 03:00:34,792 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:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-10-11 03:00:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 03:00:34,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:34,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:34,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:00:34,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1836119556, now seen corresponding path program 1 times [2024-10-11 03:00:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428429344] [2024-10-11 03:00:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:34,888 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:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:34,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428429344] [2024-10-11 03:00:34,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428429344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:34,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691610276] [2024-10-11 03:00:34,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:34,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:00:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:00:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:00:34,891 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:35,054 INFO L93 Difference]: Finished difference Result 307 states and 444 transitions. [2024-10-11 03:00:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:00:35,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2024-10-11 03:00:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:35,059 INFO L225 Difference]: With dead ends: 307 [2024-10-11 03:00:35,059 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 03:00:35,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:35,062 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 50 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:35,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 178 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 03:00:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-10-11 03:00:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 143 states have (on average 1.4475524475524475) internal successors, (207), 170 states have internal predecessors, (207), 36 states have call successors, (36), 24 states have call predecessors, (36), 22 states have return successors, (38), 20 states have call predecessors, (38), 36 states have call successors, (38) [2024-10-11 03:00:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 281 transitions. [2024-10-11 03:00:35,087 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 281 transitions. Word has length 19 [2024-10-11 03:00:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:35,087 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 281 transitions. [2024-10-11 03:00:35,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 281 transitions. [2024-10-11 03:00:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 03:00:35,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:35,089 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:35,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:00:35,089 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:35,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:35,090 INFO L85 PathProgramCache]: Analyzing trace with hash -813651959, now seen corresponding path program 1 times [2024-10-11 03:00:35,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:35,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617714105] [2024-10-11 03:00:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:35,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,180 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:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617714105] [2024-10-11 03:00:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617714105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:35,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:00:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16736234] [2024-10-11 03:00:35,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:35,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:00:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:35,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:00:35,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:00:35,183 INFO L87 Difference]: Start difference. First operand 202 states and 281 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:35,241 INFO L93 Difference]: Finished difference Result 504 states and 719 transitions. [2024-10-11 03:00:35,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:00:35,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2024-10-11 03:00:35,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:35,244 INFO L225 Difference]: With dead ends: 504 [2024-10-11 03:00:35,244 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 03:00:35,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:35,245 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:35,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 171 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:00:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 03:00:35,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2024-10-11 03:00:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 219 states have (on average 1.365296803652968) internal successors, (299), 239 states have internal predecessors, (299), 41 states have call successors, (41), 39 states have call predecessors, (41), 37 states have return successors, (59), 36 states have call predecessors, (59), 41 states have call successors, (59) [2024-10-11 03:00:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2024-10-11 03:00:35,267 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 21 [2024-10-11 03:00:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:35,268 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2024-10-11 03:00:35,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2024-10-11 03:00:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 03:00:35,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:35,269 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:35,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:00:35,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:35,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1324679984, now seen corresponding path program 1 times [2024-10-11 03:00:35,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:35,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954635924] [2024-10-11 03:00:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:35,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,328 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:35,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:35,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954635924] [2024-10-11 03:00:35,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954635924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:35,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:35,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:00:35,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434879345] [2024-10-11 03:00:35,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:35,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:00:35,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:35,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:00:35,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:00:35,331 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:35,506 INFO L93 Difference]: Finished difference Result 710 states and 974 transitions. [2024-10-11 03:00:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:35,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 03:00:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:35,510 INFO L225 Difference]: With dead ends: 710 [2024-10-11 03:00:35,510 INFO L226 Difference]: Without dead ends: 414 [2024-10-11 03:00:35,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:00:35,511 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 98 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:35,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 176 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-11 03:00:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 384. [2024-10-11 03:00:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 285 states have (on average 1.3473684210526315) internal successors, (384), 315 states have internal predecessors, (384), 47 states have call successors, (47), 39 states have call predecessors, (47), 51 states have return successors, (85), 44 states have call predecessors, (85), 47 states have call successors, (85) [2024-10-11 03:00:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 516 transitions. [2024-10-11 03:00:35,569 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 516 transitions. Word has length 32 [2024-10-11 03:00:35,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:35,570 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 516 transitions. [2024-10-11 03:00:35,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:35,570 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 516 transitions. [2024-10-11 03:00:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 03:00:35,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:35,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:35,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:00:35,572 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:35,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash 931652974, now seen corresponding path program 1 times [2024-10-11 03:00:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797760083] [2024-10-11 03:00:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,643 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:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:35,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797760083] [2024-10-11 03:00:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797760083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:35,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:00:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090693562] [2024-10-11 03:00:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:35,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:00:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:35,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:00:35,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:35,645 INFO L87 Difference]: Start difference. First operand 384 states and 516 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:35,924 INFO L93 Difference]: Finished difference Result 756 states and 1032 transitions. [2024-10-11 03:00:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:00:35,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 03:00:35,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:35,927 INFO L225 Difference]: With dead ends: 756 [2024-10-11 03:00:35,927 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 03:00:35,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:00:35,929 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 260 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:35,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 238 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:00:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 03:00:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 302. [2024-10-11 03:00:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 225 states have (on average 1.3377777777777777) internal successors, (301), 248 states have internal predecessors, (301), 38 states have call successors, (38), 32 states have call predecessors, (38), 38 states have return successors, (60), 33 states have call predecessors, (60), 38 states have call successors, (60) [2024-10-11 03:00:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 399 transitions. [2024-10-11 03:00:35,950 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 399 transitions. Word has length 32 [2024-10-11 03:00:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:35,950 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 399 transitions. [2024-10-11 03:00:35,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 399 transitions. [2024-10-11 03:00:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 03:00:35,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:35,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:35,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:00:35,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:35,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:35,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1189818412, now seen corresponding path program 1 times [2024-10-11 03:00:35,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:35,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430973798] [2024-10-11 03:00:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:35,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 03:00:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:35,993 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:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:35,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430973798] [2024-10-11 03:00:35,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430973798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:35,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:35,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:00:35,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250547866] [2024-10-11 03:00:35,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:35,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:00:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:00:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:00:35,995 INFO L87 Difference]: Start difference. First operand 302 states and 399 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:36,263 INFO L93 Difference]: Finished difference Result 702 states and 993 transitions. [2024-10-11 03:00:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:00:36,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-11 03:00:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:36,266 INFO L225 Difference]: With dead ends: 702 [2024-10-11 03:00:36,266 INFO L226 Difference]: Without dead ends: 476 [2024-10-11 03:00:36,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:00:36,268 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 146 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:36,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 231 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:00:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-11 03:00:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 458. [2024-10-11 03:00:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 341 states have (on average 1.2991202346041055) internal successors, (443), 371 states have internal predecessors, (443), 57 states have call successors, (57), 49 states have call predecessors, (57), 59 states have return successors, (115), 58 states have call predecessors, (115), 57 states have call successors, (115) [2024-10-11 03:00:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 615 transitions. [2024-10-11 03:00:36,293 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 615 transitions. Word has length 32 [2024-10-11 03:00:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:36,293 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 615 transitions. [2024-10-11 03:00:36,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 03:00:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 615 transitions. [2024-10-11 03:00:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 03:00:36,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:36,295 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:36,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:00:36,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:36,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:36,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1790226520, now seen corresponding path program 1 times [2024-10-11 03:00:36,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:36,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463437641] [2024-10-11 03:00:36,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:36,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:00:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:36,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463437641] [2024-10-11 03:00:36,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463437641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:36,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:36,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:00:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820501122] [2024-10-11 03:00:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:36,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:00:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:36,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:00:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:36,356 INFO L87 Difference]: Start difference. First operand 458 states and 615 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:00:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:36,543 INFO L93 Difference]: Finished difference Result 774 states and 1036 transitions. [2024-10-11 03:00:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:00:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-10-11 03:00:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:36,546 INFO L225 Difference]: With dead ends: 774 [2024-10-11 03:00:36,546 INFO L226 Difference]: Without dead ends: 318 [2024-10-11 03:00:36,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:00:36,547 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 252 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:36,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 165 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-11 03:00:36,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 304. [2024-10-11 03:00:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 227 states have (on average 1.2907488986784141) internal successors, (293), 248 states have internal predecessors, (293), 38 states have call successors, (38), 34 states have call predecessors, (38), 38 states have return successors, (68), 38 states have call predecessors, (68), 38 states have call successors, (68) [2024-10-11 03:00:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 399 transitions. [2024-10-11 03:00:36,563 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 399 transitions. Word has length 52 [2024-10-11 03:00:36,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:36,564 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 399 transitions. [2024-10-11 03:00:36,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 03:00:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 399 transitions. [2024-10-11 03:00:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 03:00:36,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:36,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:36,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:00:36,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:36,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1939430060, now seen corresponding path program 1 times [2024-10-11 03:00:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:36,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634555550] [2024-10-11 03:00:36,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:36,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:00:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:00:36,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:36,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634555550] [2024-10-11 03:00:36,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634555550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:00:36,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449112790] [2024-10-11 03:00:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:36,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:36,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:36,655 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:36,657 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:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:36,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:00:36,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:00:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:00:36,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:00:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:00:36,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449112790] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:00:36,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:00:36,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-11 03:00:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360168820] [2024-10-11 03:00:36,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:00:36,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:00:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:00:36,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:00:36,866 INFO L87 Difference]: Start difference. First operand 304 states and 399 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:00:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:37,269 INFO L93 Difference]: Finished difference Result 728 states and 1008 transitions. [2024-10-11 03:00:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 03:00:37,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2024-10-11 03:00:37,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:37,273 INFO L225 Difference]: With dead ends: 728 [2024-10-11 03:00:37,273 INFO L226 Difference]: Without dead ends: 485 [2024-10-11 03:00:37,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 131 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2024-10-11 03:00:37,274 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 192 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:37,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 284 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:00:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-11 03:00:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 416. [2024-10-11 03:00:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 308 states have (on average 1.2954545454545454) internal successors, (399), 338 states have internal predecessors, (399), 54 states have call successors, (54), 48 states have call predecessors, (54), 53 states have return successors, (102), 50 states have call predecessors, (102), 54 states have call successors, (102) [2024-10-11 03:00:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 555 transitions. [2024-10-11 03:00:37,306 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 555 transitions. Word has length 61 [2024-10-11 03:00:37,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:37,306 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 555 transitions. [2024-10-11 03:00:37,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 03:00:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 555 transitions. [2024-10-11 03:00:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:00:37,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:37,308 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:37,323 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:37,509 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:37,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:37,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash -499769044, now seen corresponding path program 2 times [2024-10-11 03:00:37,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:37,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227100322] [2024-10-11 03:00:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:00:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:00:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:00:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:00:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227100322] [2024-10-11 03:00:37,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227100322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:00:37,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715675682] [2024-10-11 03:00:37,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:00:37,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:37,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:00:37,708 INFO L229 MonitoredProcess]: Starting monitored process 3 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:37,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:00:37,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:00:37,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:00:37,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:00:37,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:00:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:00:37,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:00:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715675682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:37,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:00:37,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 03:00:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323447155] [2024-10-11 03:00:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:37,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:00:37,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:37,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:00:37,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:00:37,928 INFO L87 Difference]: Start difference. First operand 416 states and 555 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:00:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:38,142 INFO L93 Difference]: Finished difference Result 1090 states and 1522 transitions. [2024-10-11 03:00:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:38,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 90 [2024-10-11 03:00:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:38,150 INFO L225 Difference]: With dead ends: 1090 [2024-10-11 03:00:38,150 INFO L226 Difference]: Without dead ends: 734 [2024-10-11 03:00:38,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 03:00:38,152 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 137 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:38,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 279 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-11 03:00:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 718. [2024-10-11 03:00:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 535 states have (on average 1.2953271028037383) internal successors, (693), 580 states have internal predecessors, (693), 93 states have call successors, (93), 84 states have call predecessors, (93), 89 states have return successors, (159), 86 states have call predecessors, (159), 93 states have call successors, (159) [2024-10-11 03:00:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 945 transitions. [2024-10-11 03:00:38,234 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 945 transitions. Word has length 90 [2024-10-11 03:00:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:38,235 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 945 transitions. [2024-10-11 03:00:38,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 03:00:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 945 transitions. [2024-10-11 03:00:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:00:38,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:00:38,236 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:38,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:00:38,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:00:38,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:00:38,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:00:38,442 INFO L85 PathProgramCache]: Analyzing trace with hash 393717294, now seen corresponding path program 1 times [2024-10-11 03:00:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:00:38,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308423654] [2024-10-11 03:00:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:00:38,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:00:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 03:00:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:00:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:00:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:00:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 03:00:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 03:00:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:00:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:00:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 03:00:38,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:00:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308423654] [2024-10-11 03:00:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308423654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:00:38,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:00:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:00:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33969871] [2024-10-11 03:00:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:00:38,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:00:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:00:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:00:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:00:38,519 INFO L87 Difference]: Start difference. First operand 718 states and 945 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:00:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:00:38,699 INFO L93 Difference]: Finished difference Result 1011 states and 1310 transitions. [2024-10-11 03:00:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:00:38,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 90 [2024-10-11 03:00:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:00:38,701 INFO L225 Difference]: With dead ends: 1011 [2024-10-11 03:00:38,701 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:00:38,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:00:38,703 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 100 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:00:38,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 120 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:00:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:00:38,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:00:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:00:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:00:38,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2024-10-11 03:00:38,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:00:38,707 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:00:38,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 03:00:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:00:38,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:00:38,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:00:38,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:00:38,715 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:00:38,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:00:40,483 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:00:40,496 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (or (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))))) Eliminated clause: (or (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) (and (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0)))) [2024-10-11 03:00:40,504 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse2 (= 0 ~systemActive~0))) (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (= 1 ~systemActive~0)) (.cse1 (<= 1 |old(~waterLevel~0)|))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse0 (= |old(~pumpRunning~0)| 0) .cse1) (and .cse1 .cse2))) (or (= ~pumpRunning~0 0) (not .cse2)) (= |old(~waterLevel~0)| ~waterLevel~0))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse3 (= 0 ~systemActive~0))) (and (let ((.cse1 (= 1 ~systemActive~0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2) (and (<= 2 ~waterLevel~0) .cse1) (and .cse2 .cse3))) (or .cse0 (not .cse3)))) [2024-10-11 03:00:40,508 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (= |old(~pumpRunning~0)| 0) (<= 1 ~waterLevel~0)) Eliminated clause: (and (= ~pumpRunning~0 0) (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)) [2024-10-11 03:00:40,511 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse1 (= ~pumpRunning~0 0)) (.cse0 (= 1 ~systemActive~0)) (.cse2 (<= 1 |old(~waterLevel~0)|))) (or (and .cse0 (<= 2 |old(~waterLevel~0)|)) (and .cse1 .cse2 (= 0 ~systemActive~0)) (and .cse1 .cse0 .cse2))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse1 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse2 (<= 1 ~waterLevel~0))) (or (and .cse0 .cse1 .cse2) (and (<= 2 ~waterLevel~0) .cse1) (and .cse0 .cse2 (= 0 ~systemActive~0)))) [2024-10-11 03:00:40,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:00:40 BoogieIcfgContainer [2024-10-11 03:00:40,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:00:40,514 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:00:40,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:00:40,514 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:00:40,515 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:33" (3/4) ... [2024-10-11 03:00:40,516 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:00:40,519 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-11 03:00:40,519 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-11 03:00:40,519 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-11 03:00:40,519 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-11 03:00:40,519 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-11 03:00:40,520 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 03:00:40,520 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-11 03:00:40,524 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2024-10-11 03:00:40,524 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 03:00:40,525 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 03:00:40,525 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:00:40,525 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:00:40,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:00:40,626 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:00:40,629 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:00:40,629 INFO L158 Benchmark]: Toolchain (without parser) took 8366.69ms. Allocated memory was 220.2MB in the beginning and 314.6MB in the end (delta: 94.4MB). Free memory was 149.6MB in the beginning and 229.4MB in the end (delta: -79.9MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-11 03:00:40,629 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory was 83.6MB in the beginning and 83.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:00:40,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.53ms. Allocated memory is still 220.2MB. Free memory was 149.1MB in the beginning and 128.1MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 03:00:40,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.35ms. Allocated memory is still 220.2MB. Free memory was 128.1MB in the beginning and 125.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:00:40,632 INFO L158 Benchmark]: Boogie Preprocessor took 42.20ms. Allocated memory is still 220.2MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:00:40,632 INFO L158 Benchmark]: RCFGBuilder took 622.99ms. Allocated memory is still 220.2MB. Free memory was 123.1MB in the beginning and 98.8MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 03:00:40,632 INFO L158 Benchmark]: TraceAbstraction took 7130.64ms. Allocated memory was 220.2MB in the beginning and 314.6MB in the end (delta: 94.4MB). Free memory was 98.4MB in the beginning and 237.8MB in the end (delta: -139.5MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2024-10-11 03:00:40,632 INFO L158 Benchmark]: Witness Printer took 114.89ms. Allocated memory is still 314.6MB. Free memory was 237.8MB in the beginning and 229.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 03:00:40,633 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.13ms. Allocated memory is still 115.3MB. Free memory was 83.6MB in the beginning and 83.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.53ms. Allocated memory is still 220.2MB. Free memory was 149.1MB in the beginning and 128.1MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.35ms. Allocated memory is still 220.2MB. Free memory was 128.1MB in the beginning and 125.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.20ms. Allocated memory is still 220.2MB. Free memory was 125.6MB in the beginning and 123.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 622.99ms. Allocated memory is still 220.2MB. Free memory was 123.1MB in the beginning and 98.8MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7130.64ms. Allocated memory was 220.2MB in the beginning and 314.6MB in the end (delta: 94.4MB). Free memory was 98.4MB in the beginning and 237.8MB in the end (delta: -139.5MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. * Witness Printer took 114.89ms. Allocated memory is still 314.6MB. Free memory was 237.8MB in the beginning and 229.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] - GenericResultAtLocation [Line: 160]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [160] - GenericResultAtLocation [Line: 388]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [388] - GenericResultAtLocation [Line: 458]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [458] - GenericResultAtLocation [Line: 824]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [824] - GenericResultAtLocation [Line: 923]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [923] - GenericResultAtLocation [Line: 958]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [958] - GenericResultAtLocation [Line: 967]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [967] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 963]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1390 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1362 mSDsluCounter, 2163 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1393 mSDsCounter, 331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1860 IncrementalHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 331 mSolverCounterUnsat, 770 mSDtfsCounter, 1860 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 288 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=718occurred in iteration=11, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 228 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 621 NumberOfCodeBlocks, 621 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 667 ConstructedInterpolants, 0 QuantifiedInterpolants, 1223 SizeOfPredicates, 3 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 237/262 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 399]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 836]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: (((((2 <= waterLevel) && (1 == systemActive)) && (splverifierCounter == 0)) || ((((pumpRunning == 0) && (splverifierCounter == 0)) && (1 <= waterLevel)) && (0 == systemActive))) || ((((pumpRunning == 0) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel))) - ProcedureContractResult [Line: 263]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((1 == systemActive) && (1 <= waterLevel)) || ((2 <= waterLevel) && (0 != systemActive))) Ensures: ((pumpRunning == 0) && (((1 == systemActive) && (1 <= waterLevel)) || ((2 <= waterLevel) && (0 != systemActive)))) - ProcedureContractResult [Line: 196]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || (((pumpRunning == 0) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || (((pumpRunning == 0) && (2 <= waterLevel)) && (1 == systemActive))) - ProcedureContractResult [Line: 84]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || ((2 <= waterLevel) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= waterLevel)) && (0 == systemActive))) Ensures: (((((pumpRunning == 0) && (1 == systemActive)) && (waterLevel == 1)) || ((2 <= waterLevel) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= waterLevel)) && (0 == systemActive))) - ProcedureContractResult [Line: 826]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 172]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) || ((1 <= waterLevel) && (0 == systemActive))) && ((pumpRunning == 0) || (0 != systemActive))) Ensures: (((((((1 == systemActive) && (\old(pumpRunning) == 0)) || ((1 == systemActive) && (2 <= \old(waterLevel)))) || ((\old(pumpRunning) == 0) && (0 == systemActive))) && ((1 < waterLevel) || ((pumpRunning == 0) && (waterLevel == 1)))) && ((pumpRunning == 0) || (0 != systemActive))) && ((\old(pumpRunning) != 0) || (\old(waterLevel) == waterLevel))) - ProcedureContractResult [Line: 204]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: (((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) Ensures: ((((1 == systemActive) && (\old(pumpRunning) == 0)) && (1 <= waterLevel)) && ((pumpRunning == 0) || (1 < waterLevel))) - ProcedureContractResult [Line: 72]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((pumpRunning == 0) && (1 == systemActive)) && (1 <= waterLevel)) || ((2 <= waterLevel) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= waterLevel)) && (0 == systemActive))) Ensures: (((((pumpRunning == 0) || (\old(waterLevel) != 1)) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && (2 <= waterLevel)) && ((((pumpRunning == 0) && (1 <= \old(waterLevel))) && (0 == systemActive)) || ((1 == systemActive) && (1 <= \old(waterLevel))))) RESULT: Ultimate proved your program to be correct! [2024-10-11 03:00:40,668 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 Result: TRUE