./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_spec2_product56.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_spec2_product56.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 fa0eab3945757815cbe114f72b31b9c97b3f41e20a7d5f245c817ae82afdf9aa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:58:49,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:58:49,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:58:49,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:58:49,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:58:49,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:58:49,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:58:49,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:58:49,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:58:49,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:58:49,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:58:49,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:58:49,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:58:49,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:58:49,819 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:58:49,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:58:49,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:58:49,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:58:49,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:58:49,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:58:49,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:58:49,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:58:49,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:58:49,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:58:49,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:58:49,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:58:49,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:58:49,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:58:49,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:58:49,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:58:49,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:58:49,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:58:49,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:49,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:58:49,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:58:49,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:58:49,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:58:49,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:58:49,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:58:49,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:58:49,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:58:49,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:58:49,829 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 -> fa0eab3945757815cbe114f72b31b9c97b3f41e20a7d5f245c817ae82afdf9aa [2024-10-11 02:58:50,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:58:50,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:58:50,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:58:50,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:58:50,081 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:58:50,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product56.cil.c [2024-10-11 02:58:51,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:58:51,765 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:58:51,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product56.cil.c [2024-10-11 02:58:51,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0b4804810/2415e79f9ff54f19acd33a86fd5c4378/FLAG9e00e14cf [2024-10-11 02:58:52,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0b4804810/2415e79f9ff54f19acd33a86fd5c4378 [2024-10-11 02:58:52,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:58:52,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:58:52,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:52,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:58:52,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:58:52,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2d7a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52, skipping insertion in model container [2024-10-11 02:58:52,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:58:52,358 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_spec2_product56.cil.c[11292,11305] [2024-10-11 02:58:52,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:52,425 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:58:52,443 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-10-11 02:58:52,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [415] [2024-10-11 02:58:52,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [424] [2024-10-11 02:58:52,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [535] [2024-10-11 02:58:52,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [575] [2024-10-11 02:58:52,450 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [827] [2024-10-11 02:58:52,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [897] [2024-10-11 02:58:52,452 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [935] [2024-10-11 02:58:52,494 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_spec2_product56.cil.c[11292,11305] [2024-10-11 02:58:52,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:58:52,524 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:58:52,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52 WrapperNode [2024-10-11 02:58:52,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:58:52,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:52,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:58:52,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:58:52,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,586 INFO L138 Inliner]: procedures = 59, calls = 106, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 232 [2024-10-11 02:58:52,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:58:52,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:58:52,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:58:52,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:58:52,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,613 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 02:58:52,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:58:52,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:58:52,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:58:52,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:58:52,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (1/1) ... [2024-10-11 02:58:52,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:58:52,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:52,668 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 02:58:52,681 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 02:58:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:58:52,734 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-11 02:58:52,735 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-11 02:58:52,735 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:58:52,735 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:58:52,735 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:58:52,735 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:58:52,735 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-11 02:58:52,735 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-11 02:58:52,735 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:52,735 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:58:52,736 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-11 02:58:52,736 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-11 02:58:52,736 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-11 02:58:52,736 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2024-10-11 02:58:52,736 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-10-11 02:58:52,736 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-10-11 02:58:52,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:58:52,736 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-11 02:58:52,737 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-11 02:58:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:58:52,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:58:52,801 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:58:52,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:58:53,032 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-11 02:58:53,033 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:58:53,087 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:58:53,088 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 02:58:53,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:53 BoogieIcfgContainer [2024-10-11 02:58:53,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:58:53,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:58:53,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:58:53,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:58:53,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:58:52" (1/3) ... [2024-10-11 02:58:53,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f73a0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:53, skipping insertion in model container [2024-10-11 02:58:53,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:58:52" (2/3) ... [2024-10-11 02:58:53,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f73a0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:58:53, skipping insertion in model container [2024-10-11 02:58:53,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:53" (3/3) ... [2024-10-11 02:58:53,096 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product56.cil.c [2024-10-11 02:58:53,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:58:53,113 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:58:53,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:58:53,207 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;@717dc45a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:58:53,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:58:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 67 states have internal predecessors, (86), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 02:58:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:58:53,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:53,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:53,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash -537591985, now seen corresponding path program 1 times [2024-10-11 02:58:53,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:53,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61674952] [2024-10-11 02:58:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:53,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:58:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:53,373 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 02:58:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61674952] [2024-10-11 02:58:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61674952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:53,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:53,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:58:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027907800] [2024-10-11 02:58:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:53,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:58:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:58:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:58:53,406 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 67 states have internal predecessors, (86), 17 states have call successors, (17), 9 states have call predecessors, (17), 9 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:53,496 INFO L93 Difference]: Finished difference Result 166 states and 241 transitions. [2024-10-11 02:58:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:58:53,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 02:58:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:53,508 INFO L225 Difference]: With dead ends: 166 [2024-10-11 02:58:53,509 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 02:58:53,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:58:53,519 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:53,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 02:58:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 02:58:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 63 states have internal predecessors, (76), 17 states have call successors, (17), 9 states have call predecessors, (17), 8 states have return successors, (16), 11 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 02:58:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2024-10-11 02:58:53,565 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 17 [2024-10-11 02:58:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:53,566 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2024-10-11 02:58:53,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2024-10-11 02:58:53,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:58:53,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:53,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:53,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:58:53,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:53,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -921157841, now seen corresponding path program 1 times [2024-10-11 02:58:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:53,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313978766] [2024-10-11 02:58:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:58:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:53,766 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 02:58:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313978766] [2024-10-11 02:58:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313978766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173768651] [2024-10-11 02:58:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:53,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:53,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:53,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:53,776 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:53,827 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2024-10-11 02:58:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:53,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 02:58:53,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:53,829 INFO L225 Difference]: With dead ends: 128 [2024-10-11 02:58:53,829 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 02:58:53,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:53,832 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 14 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:53,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 152 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:58:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 02:58:53,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 02:58:53,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 58 states have internal predecessors, (70), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 02:58:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2024-10-11 02:58:53,848 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 18 [2024-10-11 02:58:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:53,849 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2024-10-11 02:58:53,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2024-10-11 02:58:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 02:58:53,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:53,851 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 02:58:53,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:58:53,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:53,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1423092211, now seen corresponding path program 1 times [2024-10-11 02:58:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311710789] [2024-10-11 02:58:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:53,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:53,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:53,966 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 02:58:53,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:53,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311710789] [2024-10-11 02:58:53,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311710789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:53,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 02:58:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622635736] [2024-10-11 02:58:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:53,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:53,971 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:54,047 INFO L93 Difference]: Finished difference Result 209 states and 291 transitions. [2024-10-11 02:58:54,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:54,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 02:58:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:54,049 INFO L225 Difference]: With dead ends: 209 [2024-10-11 02:58:54,050 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 02:58:54,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 02:58:54,051 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 92 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:54,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 179 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 02:58:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-10-11 02:58:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 111 states have internal predecessors, (135), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (28), 17 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 02:58:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2024-10-11 02:58:54,066 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 21 [2024-10-11 02:58:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:54,067 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2024-10-11 02:58:54,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2024-10-11 02:58:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 02:58:54,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:54,068 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] [2024-10-11 02:58:54,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:58:54,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:54,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2091259468, now seen corresponding path program 1 times [2024-10-11 02:58:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039302099] [2024-10-11 02:58:54,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:58:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,121 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 02:58:54,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:54,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039302099] [2024-10-11 02:58:54,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039302099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:54,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:54,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:58:54,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678869033] [2024-10-11 02:58:54,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:54,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:58:54,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:54,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:58:54,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:58:54,123 INFO L87 Difference]: Start difference. First operand 137 states and 191 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:54,213 INFO L93 Difference]: Finished difference Result 354 states and 505 transitions. [2024-10-11 02:58:54,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:58:54,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-11 02:58:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:54,217 INFO L225 Difference]: With dead ends: 354 [2024-10-11 02:58:54,217 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 02:58:54,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:54,223 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 62 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:54,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 230 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 02:58:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2024-10-11 02:58:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 151 states have (on average 1.3841059602649006) internal successors, (209), 168 states have internal predecessors, (209), 36 states have call successors, (36), 30 states have call predecessors, (36), 30 states have return successors, (48), 31 states have call predecessors, (48), 36 states have call successors, (48) [2024-10-11 02:58:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 293 transitions. [2024-10-11 02:58:54,270 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 293 transitions. Word has length 24 [2024-10-11 02:58:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:54,270 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 293 transitions. [2024-10-11 02:58:54,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 02:58:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 293 transitions. [2024-10-11 02:58:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:58:54,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:54,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:54,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:58:54,274 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash -543291110, now seen corresponding path program 1 times [2024-10-11 02:58:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177746102] [2024-10-11 02:58:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:58:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,437 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 02:58:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:54,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177746102] [2024-10-11 02:58:54,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177746102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:54,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:54,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435146460] [2024-10-11 02:58:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:54,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:54,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:54,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:54,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:54,441 INFO L87 Difference]: Start difference. First operand 218 states and 293 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:58:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:54,595 INFO L93 Difference]: Finished difference Result 486 states and 661 transitions. [2024-10-11 02:58:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 02:58:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:54,599 INFO L225 Difference]: With dead ends: 486 [2024-10-11 02:58:54,602 INFO L226 Difference]: Without dead ends: 270 [2024-10-11 02:58:54,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:54,605 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 53 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:54,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 225 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-11 02:58:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2024-10-11 02:58:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 187 states have (on average 1.3529411764705883) internal successors, (253), 204 states have internal predecessors, (253), 40 states have call successors, (40), 30 states have call predecessors, (40), 40 states have return successors, (62), 43 states have call predecessors, (62), 40 states have call successors, (62) [2024-10-11 02:58:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 355 transitions. [2024-10-11 02:58:54,666 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 355 transitions. Word has length 38 [2024-10-11 02:58:54,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:54,666 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 355 transitions. [2024-10-11 02:58:54,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:58:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 355 transitions. [2024-10-11 02:58:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:58:54,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:54,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:54,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:58:54,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:54,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:54,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2131639012, now seen corresponding path program 1 times [2024-10-11 02:58:54,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:54,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784463573] [2024-10-11 02:58:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:58:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:54,879 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 02:58:54,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:54,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784463573] [2024-10-11 02:58:54,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784463573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:54,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:54,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:54,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710305214] [2024-10-11 02:58:54,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:54,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:54,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:54,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:54,881 INFO L87 Difference]: Start difference. First operand 268 states and 355 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:58:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:55,097 INFO L93 Difference]: Finished difference Result 540 states and 739 transitions. [2024-10-11 02:58:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:58:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-11 02:58:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:55,099 INFO L225 Difference]: With dead ends: 540 [2024-10-11 02:58:55,103 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 02:58:55,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:55,107 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 53 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:55,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 222 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:58:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 02:58:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2024-10-11 02:58:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 191 states have (on average 1.3455497382198953) internal successors, (257), 208 states have internal predecessors, (257), 40 states have call successors, (40), 30 states have call predecessors, (40), 40 states have return successors, (62), 43 states have call predecessors, (62), 40 states have call successors, (62) [2024-10-11 02:58:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2024-10-11 02:58:55,153 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 38 [2024-10-11 02:58:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:55,153 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2024-10-11 02:58:55,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 02:58:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2024-10-11 02:58:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 02:58:55,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:55,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:55,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:58:55,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:55,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:55,160 INFO L85 PathProgramCache]: Analyzing trace with hash 474384542, now seen corresponding path program 1 times [2024-10-11 02:58:55,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:55,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102799684] [2024-10-11 02:58:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:55,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:58:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:55,341 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 02:58:55,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:55,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102799684] [2024-10-11 02:58:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102799684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:55,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:55,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180410502] [2024-10-11 02:58:55,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:55,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:55,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:55,343 INFO L87 Difference]: Start difference. First operand 272 states and 359 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:58:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:55,759 INFO L93 Difference]: Finished difference Result 782 states and 1071 transitions. [2024-10-11 02:58:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:58:55,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2024-10-11 02:58:55,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:55,769 INFO L225 Difference]: With dead ends: 782 [2024-10-11 02:58:55,770 INFO L226 Difference]: Without dead ends: 512 [2024-10-11 02:58:55,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:55,776 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:55,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 236 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:58:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-11 02:58:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 506. [2024-10-11 02:58:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 357 states have (on average 1.2941176470588236) internal successors, (462), 383 states have internal predecessors, (462), 75 states have call successors, (75), 67 states have call predecessors, (75), 73 states have return successors, (127), 76 states have call predecessors, (127), 75 states have call successors, (127) [2024-10-11 02:58:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 664 transitions. [2024-10-11 02:58:55,850 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 664 transitions. Word has length 38 [2024-10-11 02:58:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:55,850 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 664 transitions. [2024-10-11 02:58:55,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:58:55,851 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 664 transitions. [2024-10-11 02:58:55,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-11 02:58:55,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:55,853 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:55,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:58:55,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:55,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2053786684, now seen corresponding path program 1 times [2024-10-11 02:58:55,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:55,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10903288] [2024-10-11 02:58:55,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:55,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:55,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:56,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:58:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:58:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:56,047 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 02:58:56,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10903288] [2024-10-11 02:58:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10903288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:58:56,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075235836] [2024-10-11 02:58:56,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:56,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:58:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:58:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:58:56,057 INFO L87 Difference]: Start difference. First operand 506 states and 664 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:58:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:56,842 INFO L93 Difference]: Finished difference Result 1036 states and 1463 transitions. [2024-10-11 02:58:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:58:56,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2024-10-11 02:58:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:56,852 INFO L225 Difference]: With dead ends: 1036 [2024-10-11 02:58:56,856 INFO L226 Difference]: Without dead ends: 1034 [2024-10-11 02:58:56,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:58:56,858 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 294 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:56,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 141 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:58:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-11 02:58:57,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 932. [2024-10-11 02:58:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 653 states have (on average 1.3047473200612558) internal successors, (852), 712 states have internal predecessors, (852), 148 states have call successors, (148), 106 states have call predecessors, (148), 130 states have return successors, (325), 144 states have call predecessors, (325), 148 states have call successors, (325) [2024-10-11 02:58:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1325 transitions. [2024-10-11 02:58:57,020 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1325 transitions. Word has length 42 [2024-10-11 02:58:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:57,021 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1325 transitions. [2024-10-11 02:58:57,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 02:58:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1325 transitions. [2024-10-11 02:58:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 02:58:57,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:57,027 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:57,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:58:57,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:57,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:57,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1758539377, now seen corresponding path program 1 times [2024-10-11 02:58:57,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:57,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145079537] [2024-10-11 02:58:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:57,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 02:58:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:58:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:58:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 02:58:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145079537] [2024-10-11 02:58:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145079537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:57,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:58:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:58:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394583528] [2024-10-11 02:58:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:58:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:57,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:58:57,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:58:57,166 INFO L87 Difference]: Start difference. First operand 932 states and 1325 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 02:58:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:57,735 INFO L93 Difference]: Finished difference Result 1514 states and 2140 transitions. [2024-10-11 02:58:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:58:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 68 [2024-10-11 02:58:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:57,739 INFO L225 Difference]: With dead ends: 1514 [2024-10-11 02:58:57,739 INFO L226 Difference]: Without dead ends: 584 [2024-10-11 02:58:57,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:58:57,747 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 260 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:57,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 195 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 02:58:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-11 02:58:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 552. [2024-10-11 02:58:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 389 states have (on average 1.2930591259640103) internal successors, (503), 425 states have internal predecessors, (503), 85 states have call successors, (85), 64 states have call predecessors, (85), 77 states have return successors, (172), 83 states have call predecessors, (172), 85 states have call successors, (172) [2024-10-11 02:58:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 760 transitions. [2024-10-11 02:58:57,829 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 760 transitions. Word has length 68 [2024-10-11 02:58:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:57,829 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 760 transitions. [2024-10-11 02:58:57,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-11 02:58:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 760 transitions. [2024-10-11 02:58:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 02:58:57,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:57,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:57,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:58:57,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:57,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1816305105, now seen corresponding path program 1 times [2024-10-11 02:58:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809012192] [2024-10-11 02:58:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:57,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:58:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:58:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:58:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 02:58:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809012192] [2024-10-11 02:58:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809012192] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550033776] [2024-10-11 02:58:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:58,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:58,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:58,076 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 02:58:58,078 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 02:58:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 02:58:58,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:58,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:58:58,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550033776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:58:58,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:58:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-10-11 02:58:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739048412] [2024-10-11 02:58:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:58:58,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:58:58,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:58:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:58,257 INFO L87 Difference]: Start difference. First operand 552 states and 760 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:58:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:58:58,349 INFO L93 Difference]: Finished difference Result 941 states and 1327 transitions. [2024-10-11 02:58:58,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:58:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2024-10-11 02:58:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:58:58,352 INFO L225 Difference]: With dead ends: 941 [2024-10-11 02:58:58,352 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 02:58:58,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:58:58,354 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:58:58,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 172 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:58:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 02:58:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2024-10-11 02:58:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 330 states have (on average 1.2636363636363637) internal successors, (417), 362 states have internal predecessors, (417), 73 states have call successors, (73), 57 states have call predecessors, (73), 65 states have return successors, (106), 70 states have call predecessors, (106), 73 states have call successors, (106) [2024-10-11 02:58:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 596 transitions. [2024-10-11 02:58:58,406 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 596 transitions. Word has length 79 [2024-10-11 02:58:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:58:58,406 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 596 transitions. [2024-10-11 02:58:58,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-11 02:58:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 596 transitions. [2024-10-11 02:58:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 02:58:58,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:58:58,408 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:58:58,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:58:58,608 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 02:58:58,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:58:58,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:58:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1378746012, now seen corresponding path program 1 times [2024-10-11 02:58:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:58:58,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766088401] [2024-10-11 02:58:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:58:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 02:58:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:58:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:58:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:58:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:58:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:58:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:58:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:58:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 02:58:58,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:58:58,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766088401] [2024-10-11 02:58:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766088401] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:58:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832197347] [2024-10-11 02:58:58,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:58:58,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:58:58,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:58:58,838 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 02:58:58,847 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 02:58:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:58:58,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 02:58:58,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:58:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:58:59,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:58:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 02:58:59,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832197347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:58:59,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:58:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 6] total 16 [2024-10-11 02:58:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533603025] [2024-10-11 02:58:59,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:58:59,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:58:59,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:58:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:58:59,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:58:59,285 INFO L87 Difference]: Start difference. First operand 469 states and 596 transitions. Second operand has 16 states, 15 states have (on average 8.4) internal successors, (126), 12 states have internal predecessors, (126), 7 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) [2024-10-11 02:59:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:02,521 INFO L93 Difference]: Finished difference Result 2337 states and 3242 transitions. [2024-10-11 02:59:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-10-11 02:59:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.4) internal successors, (126), 12 states have internal predecessors, (126), 7 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) Word has length 87 [2024-10-11 02:59:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:02,532 INFO L225 Difference]: With dead ends: 2337 [2024-10-11 02:59:02,533 INFO L226 Difference]: Without dead ends: 1870 [2024-10-11 02:59:02,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 209 SyntacticMatches, 2 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5234 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1380, Invalid=12426, Unknown=0, NotChecked=0, Total=13806 [2024-10-11 02:59:02,541 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1468 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 3492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 2703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:02,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 1110 Invalid, 3492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 2703 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:59:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2024-10-11 02:59:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1540. [2024-10-11 02:59:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1076 states have (on average 1.1821561338289963) internal successors, (1272), 1172 states have internal predecessors, (1272), 243 states have call successors, (243), 191 states have call predecessors, (243), 220 states have return successors, (366), 234 states have call predecessors, (366), 243 states have call successors, (366) [2024-10-11 02:59:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 1881 transitions. [2024-10-11 02:59:02,712 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 1881 transitions. Word has length 87 [2024-10-11 02:59:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:02,713 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 1881 transitions. [2024-10-11 02:59:02,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.4) internal successors, (126), 12 states have internal predecessors, (126), 7 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (24), 8 states have call predecessors, (24), 7 states have call successors, (24) [2024-10-11 02:59:02,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 1881 transitions. [2024-10-11 02:59:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:59:02,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:59:02,716 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:59:02,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 02:59:02,919 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 02:59:02,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:59:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:59:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1054949402, now seen corresponding path program 1 times [2024-10-11 02:59:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:59:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847047979] [2024-10-11 02:59:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:59:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:02,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:59:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:59:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 02:59:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 02:59:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:59:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:59:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:59:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:59:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 02:59:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:59:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:59:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 02:59:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:59:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847047979] [2024-10-11 02:59:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847047979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:59:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888529054] [2024-10-11 02:59:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:59:03,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:59:03,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:59:03,066 INFO L229 MonitoredProcess]: Starting monitored process 4 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 02:59:03,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:59:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:59:03,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 02:59:03,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:59:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 02:59:03,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:59:03,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888529054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:59:03,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:59:03,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2024-10-11 02:59:03,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211343085] [2024-10-11 02:59:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:59:03,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:59:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:59:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:59:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:59:03,239 INFO L87 Difference]: Start difference. First operand 1540 states and 1881 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:59:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:59:03,423 INFO L93 Difference]: Finished difference Result 2589 states and 3163 transitions. [2024-10-11 02:59:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 02:59:03,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-10-11 02:59:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:59:03,426 INFO L225 Difference]: With dead ends: 2589 [2024-10-11 02:59:03,426 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 02:59:03,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:59:03,430 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 30 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:59:03,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 535 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:59:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 02:59:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 02:59:03,431 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 02:59:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 02:59:03,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-10-11 02:59:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:59:03,432 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 02:59:03,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:59:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 02:59:03,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 02:59:03,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:59:03,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:59:03,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:59:03,642 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:59:03,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 02:59:13,615 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:59:13,633 WARN L155 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (let ((.cse1 (= 1 ~systemActive~0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse3 (<= 1 ~methaneLevelCritical~0)) (.cse4 (<= 2 ~waterLevel~0)) (.cse2 (<= 1 |old(~pumpRunning~0)|)) (.cse5 (not (= 0 ~systemActive~0)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 (<= 1 ~waterLevel~0) .cse2) (and (= ~methAndRunningLastTime~0 0) .cse3 .cse1 .cse2) (and .cse0 .cse4 .cse2 .cse5) (and .cse3 .cse4 .cse2 .cse5))) (= ~pumpRunning~0 |old(~pumpRunning~0)|)) Eliminated clause: (let ((.cse1 (= ~methaneLevelCritical~0 0)) (.cse4 (<= 2 ~waterLevel~0)) (.cse5 (not (= 0 ~systemActive~0))) (.cse0 (<= 1 ~pumpRunning~0)) (.cse3 (<= 1 ~methaneLevelCritical~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2 (<= 1 ~waterLevel~0)) (and .cse0 .cse1 .cse4 .cse5) (and .cse0 .cse3 .cse4 .cse5) (and .cse0 (= ~methAndRunningLastTime~0 0) .cse3 .cse2))) [2024-10-11 02:59:13,654 WARN L155 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (or (<= 1 ~methaneLevelCritical~0) (< |old(~methaneLevelCritical~0)| 1)) (let ((.cse3 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse5 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse6 (<= 1 ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse4 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5 .cse3) (and .cse6 .cse5 (<= 2 ~waterLevel~0) .cse4) (and .cse0 .cse1 .cse5 .cse4) (and .cse6 .cse1 .cse2 .cse4))) (or (not .cse2) (= ~methaneLevelCritical~0 0)))) Eliminated clause: (exists ((|old(~methaneLevelCritical~0)| Int)) (let ((.cse2 (= |old(~methaneLevelCritical~0)| 0))) (and (or (< |old(~methaneLevelCritical~0)| 1) (< 0 ~methaneLevelCritical~0)) (let ((.cse3 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse5 (<= 1 |old(~methaneLevelCritical~0)|)) (.cse6 (<= 1 ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse4 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse0 .cse1 .cse5 .cse3) (and .cse6 .cse5 (<= 2 ~waterLevel~0) .cse4) (and .cse0 .cse1 .cse5 .cse4) (and .cse6 .cse1 .cse2 .cse4))) (or (not .cse2) (= ~methaneLevelCritical~0 0))))) [2024-10-11 02:59:13,661 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 02:59:13,669 WARN L155 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (and (let ((.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 0 ~systemActive~0)) (.cse6 (= |old(~methAndRunningLastTime~0)| 0)) (.cse1 (= |old(~pumpRunning~0)| 0)) (.cse0 (<= 1 ~methaneLevelCritical~0)) (.cse4 (= 1 ~systemActive~0)) (.cse5 (<= 1 |old(~pumpRunning~0)|))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse3 .cse6 .cse4 .cse1) (and .cse3 .cse1 .cse2) (and .cse0 .cse6 .cse4 .cse5) (and .cse0 .cse6 .cse4 .cse1) (and .cse0 .cse4 (<= 2 |old(~waterLevel~0)|) .cse5))) (= ~pumpRunning~0 |old(~pumpRunning~0)|) (= |old(~waterLevel~0)| ~waterLevel~0) (= |old(~methAndRunningLastTime~0)| ~methAndRunningLastTime~0)) Eliminated clause: (let ((.cse6 (= 0 ~systemActive~0)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3) (and .cse4 .cse2 (<= 2 ~waterLevel~0) .cse3) (and .cse0 .cse5 .cse6) (and .cse0 .cse2 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse5 .cse3))) [2024-10-11 02:59:13,696 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse2 (= ~methAndRunningLastTime~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 .cse1 (<= 1 |old(~pumpRunning~0)|)) (and .cse2 (<= 1 ~methaneLevelCritical~0) .cse1 .cse3) (and .cse2 .cse0 .cse1 .cse3)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse2) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2))) [2024-10-11 02:59:13,703 WARN L155 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (and (let ((.cse5 (<= 1 ~pumpRunning~0)) (.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse4 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse6 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse1 .cse6 .cse3) (and .cse5 .cse2 .cse3 (<= 2 |old(~waterLevel~0)|)) (and .cse0 .cse1 .cse6 .cse4) (and .cse0 .cse1 .cse6 .cse3))) (= |old(~waterLevel~0)| ~waterLevel~0)) Eliminated clause: (let ((.cse2 (<= 1 ~methaneLevelCritical~0)) (.cse4 (<= 1 ~pumpRunning~0)) (.cse5 (= 0 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse6 (= ~methaneLevelCritical~0 0)) (.cse3 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2 (<= 2 ~waterLevel~0) .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse4 .cse1 .cse6 .cse3) (and .cse0 .cse1 .cse6 .cse5) (and .cse0 .cse1 .cse6 .cse3))) [2024-10-11 02:59:13,711 WARN L155 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__lowWaterSensor contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse2 (= ~methAndRunningLastTime~0 0)) (.cse0 (= ~methaneLevelCritical~0 0)) (.cse1 (= 1 ~systemActive~0)) (.cse3 (= |old(~pumpRunning~0)| 0))) (or (and .cse0 .cse1 (<= 1 |old(~pumpRunning~0)|)) (and .cse2 (<= 1 ~methaneLevelCritical~0) .cse1 .cse3) (and .cse2 .cse0 .cse1 .cse3)))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (= ~methaneLevelCritical~0 0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 (<= 1 ~methaneLevelCritical~0) .cse2) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2))) [2024-10-11 02:59:13,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:59:13 BoogieIcfgContainer [2024-10-11 02:59:13,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:59:13,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:59:13,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:59:13,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:59:13,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:58:53" (3/4) ... [2024-10-11 02:59:13,718 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-10-11 02:59:13,721 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2024-10-11 02:59:13,726 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2024-10-11 02:59:13,727 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 02:59:13,727 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 02:59:13,727 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:59:13,728 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 02:59:13,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:59:13,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 02:59:13,835 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:59:13,836 INFO L158 Benchmark]: Toolchain (without parser) took 21779.40ms. Allocated memory was 199.2MB in the beginning and 373.3MB in the end (delta: 174.1MB). Free memory was 168.8MB in the beginning and 331.7MB in the end (delta: -162.9MB). Peak memory consumption was 225.7MB. Max. memory is 16.1GB. [2024-10-11 02:59:13,836 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 130.0MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:59:13,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.10ms. Allocated memory is still 199.2MB. Free memory was 168.6MB in the beginning and 149.9MB in the end (delta: 18.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-10-11 02:59:13,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.33ms. Allocated memory is still 199.2MB. Free memory was 149.9MB in the beginning and 147.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:59:13,837 INFO L158 Benchmark]: Boogie Preprocessor took 39.48ms. Allocated memory is still 199.2MB. Free memory was 147.8MB in the beginning and 145.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:59:13,837 INFO L158 Benchmark]: RCFGBuilder took 461.01ms. Allocated memory is still 199.2MB. Free memory was 145.7MB in the beginning and 119.4MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 02:59:13,837 INFO L158 Benchmark]: TraceAbstraction took 20624.99ms. Allocated memory was 199.2MB in the beginning and 373.3MB in the end (delta: 174.1MB). Free memory was 119.4MB in the beginning and 121.7MB in the end (delta: -2.3MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. [2024-10-11 02:59:13,838 INFO L158 Benchmark]: Witness Printer took 119.61ms. Allocated memory is still 373.3MB. Free memory was 121.7MB in the beginning and 331.7MB in the end (delta: -210.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 02:59:13,839 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.42ms. Allocated memory is still 130.0MB. Free memory is still 91.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.10ms. Allocated memory is still 199.2MB. Free memory was 168.6MB in the beginning and 149.9MB in the end (delta: 18.7MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.33ms. Allocated memory is still 199.2MB. Free memory was 149.9MB in the beginning and 147.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.48ms. Allocated memory is still 199.2MB. Free memory was 147.8MB in the beginning and 145.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 461.01ms. Allocated memory is still 199.2MB. Free memory was 145.7MB in the beginning and 119.4MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20624.99ms. Allocated memory was 199.2MB in the beginning and 373.3MB in the end (delta: 174.1MB). Free memory was 119.4MB in the beginning and 121.7MB in the end (delta: -2.3MB). Peak memory consumption was 179.0MB. Max. memory is 16.1GB. * Witness Printer took 119.61ms. Allocated memory is still 373.3MB. Free memory was 121.7MB in the beginning and 331.7MB in the end (delta: -210.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [415] - GenericResultAtLocation [Line: 424]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [424] - GenericResultAtLocation [Line: 535]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [535] - GenericResultAtLocation [Line: 575]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [575] - GenericResultAtLocation [Line: 827]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [827] - GenericResultAtLocation [Line: 897]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [897] - GenericResultAtLocation [Line: 935]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [935] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 420]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2626 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2582 mSDsluCounter, 3495 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2322 mSDsCounter, 1154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3950 IncrementalHoareTripleChecker+Invalid, 5104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1154 mSolverCounterUnsat, 1173 mSDtfsCounter, 3950 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 482 SyntacticMatches, 3 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5284 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1540occurred in iteration=11, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 478 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 889 ConstructedInterpolants, 0 QuantifiedInterpolants, 1598 SizeOfPredicates, 3 NumberOfNonLiveVariables, 922 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 233/249 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: 947]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 838]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 839]: Loop Invariant Derived loop invariant: ((((((((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (splverifierCounter == 0))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (splverifierCounter == 0)) && (0 == systemActive))) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (splverifierCounter == 0)) && (0 == systemActive))) - ProcedureContractResult [Line: 702]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: (((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || ((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (2 <= waterLevel)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (0 != systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive))) Ensures: ((((((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= \old(pumpRunning))) || ((((1 <= methaneLevelCritical) && (1 == systemActive)) && (1 <= waterLevel)) && (1 <= \old(pumpRunning)))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= \old(pumpRunning)))) || ((((methaneLevelCritical == 0) && (2 <= waterLevel)) && (1 <= \old(pumpRunning))) && (0 != systemActive))) || ((((1 <= methaneLevelCritical) && (2 <= waterLevel)) && (1 <= \old(pumpRunning))) && (0 != systemActive))) && (pumpRunning == 0)) - ProcedureContractResult [Line: 609]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) - ProcedureContractResult [Line: 459]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Ensures: ((((\old(methaneLevelCritical) != 0) || (0 < methaneLevelCritical)) && (((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (0 == systemActive)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(methaneLevelCritical))) && (0 == systemActive))) || ((((1 <= pumpRunning) && (1 <= \old(methaneLevelCritical))) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= \old(methaneLevelCritical))) && (1 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (\old(methaneLevelCritical) == 0)) && (1 == systemActive)))) && ((methaneLevelCritical == 0) || (\old(methaneLevelCritical) < 1))) - ProcedureContractResult [Line: 937]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 585]: Procedure Contract for timeShift Derived contract for procedure timeShift. Requires: ((((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (1 == systemActive))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((((((((((1 <= methaneLevelCritical) && (\old(pumpRunning) == 0)) && (0 == systemActive)) || (((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= \old(pumpRunning)))) || ((((methaneLevelCritical == 0) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || (((methaneLevelCritical == 0) && (\old(pumpRunning) == 0)) && (0 == systemActive))) || ((((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (1 <= \old(pumpRunning)))) || ((((1 <= methaneLevelCritical) && (\old(methAndRunningLastTime) == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((((1 <= methaneLevelCritical) && (1 == systemActive)) && (2 <= \old(waterLevel))) && (1 <= \old(pumpRunning)))) && ((0 < waterLevel) || (\old(waterLevel) < 2))) && ((\old(waterLevel) != 0) || (waterLevel == 0))) && (((\old(pumpRunning) < 1) || (methaneLevelCritical < 1)) || ((pumpRunning == 0) && (methAndRunningLastTime == 0)))) && ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(waterLevel) == waterLevel)) || (0 != systemActive))) && ((methAndRunningLastTime == 0) || (methaneLevelCritical != 0))) && (((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1)) || ((pumpRunning == 0) && (methAndRunningLastTime == 0)))) && (((\old(pumpRunning) != 0) || (((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (\old(waterLevel) == waterLevel))) || (((1 <= pumpRunning) && (2 <= waterLevel)) && (\old(waterLevel) == waterLevel)))) - ProcedureContractResult [Line: 471]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: (((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive))) Ensures: ((\result == methaneLevelCritical) && (((((((((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (0 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (1 <= waterLevel))) || (((pumpRunning == 0) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((pumpRunning == 0) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)))) - ProcedureContractResult [Line: 617]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: (((((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= \old(pumpRunning))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || ((1 <= pumpRunning) && (2 <= waterLevel)))) && ((pumpRunning == \old(pumpRunning)) || (\old(pumpRunning) < 1))) - ProcedureContractResult [Line: 447]: Procedure Contract for waterRise Derived contract for procedure waterRise. Requires: (((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (2 <= waterLevel)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (0 == systemActive))) || ((((1 <= pumpRunning) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((1 <= pumpRunning) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (2 <= \old(waterLevel)))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (0 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && ((0 < waterLevel) || (\old(waterLevel) != 0))) && ((\old(waterLevel) < 2) || (\old(waterLevel) == waterLevel))) && ((\old(waterLevel) != 1) || (1 < waterLevel))) - ProcedureContractResult [Line: 643]: Procedure Contract for processEnvironment__wrappee__lowWaterSensor Derived contract for procedure processEnvironment__wrappee__lowWaterSensor. Requires: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 <= methaneLevelCritical)) && (1 == systemActive)) || (((1 <= pumpRunning) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: (((((((methaneLevelCritical == 0) && (1 == systemActive)) && (1 <= \old(pumpRunning))) || ((((methAndRunningLastTime == 0) && (1 <= methaneLevelCritical)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) || ((((methAndRunningLastTime == 0) && (methaneLevelCritical == 0)) && (1 == systemActive)) && (\old(pumpRunning) == 0))) && (((\old(pumpRunning) != 0) || (pumpRunning == 0)) || ((1 <= pumpRunning) && (2 <= waterLevel)))) && (((pumpRunning == \old(pumpRunning)) || (pumpRunning == 0)) || (\old(pumpRunning) < 1))) RESULT: Ultimate proved your program to be correct! [2024-10-11 02:59:13,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE