./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01b43f7e7ecd5c44c6b49183e9415dee9518d36285d69624307f5a03549da1bb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:13:16,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:13:16,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:13:16,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:13:16,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:13:16,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:13:16,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:13:16,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:13:16,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:13:16,194 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:13:16,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:13:16,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:13:16,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:13:16,195 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:13:16,197 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:13:16,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:13:16,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:13:16,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:13:16,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:13:16,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:13:16,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:13:16,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:13:16,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:13:16,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:13:16,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:13:16,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:13:16,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:13:16,205 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:13:16,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:13:16,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:13:16,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:13:16,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:13:16,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:13:16,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:13:16,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:13:16,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:13:16,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:13:16,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:13:16,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:13:16,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:13:16,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:13:16,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:13:16,208 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01b43f7e7ecd5c44c6b49183e9415dee9518d36285d69624307f5a03549da1bb [2024-11-08 15:13:16,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:13:16,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:13:16,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:13:16,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:13:16,475 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:13:16,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c [2024-11-08 15:13:17,886 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:13:18,124 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:13:18,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c [2024-11-08 15:13:18,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da21e369d/e2e3db81ead4492e92066dad34b6a89a/FLAG325f81961 [2024-11-08 15:13:18,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da21e369d/e2e3db81ead4492e92066dad34b6a89a [2024-11-08 15:13:18,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:13:18,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:13:18,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:13:18,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:13:18,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:13:18,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:13:18" (1/1) ... [2024-11-08 15:13:18,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@205bbde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:18, skipping insertion in model container [2024-11-08 15:13:18,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:13:18" (1/1) ... [2024-11-08 15:13:18,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:13:18,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c[6381,6394] [2024-11-08 15:13:18,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:13:18,921 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:13:18,931 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2024-11-08 15:13:18,932 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [150] [2024-11-08 15:13:18,932 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [342] [2024-11-08 15:13:18,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [410] [2024-11-08 15:13:18,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [419] [2024-11-08 15:13:18,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [445] [2024-11-08 15:13:18,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] [2024-11-08 15:13:18,933 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [910] [2024-11-08 15:13:18,961 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product43.cil.c[6381,6394] [2024-11-08 15:13:19,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:13:19,029 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:13:19,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19 WrapperNode [2024-11-08 15:13:19,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:13:19,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:13:19,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:13:19,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:13:19,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,096 INFO L138 Inliner]: procedures = 54, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 188 [2024-11-08 15:13:19,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:13:19,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:13:19,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:13:19,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:13:19,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,126 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:13:19,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,137 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:13:19,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:13:19,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:13:19,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:13:19,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (1/1) ... [2024-11-08 15:13:19,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:13:19,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:13:19,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:13:19,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:13:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:13:19,244 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-08 15:13:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-08 15:13:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-08 15:13:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-08 15:13:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-08 15:13:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-08 15:13:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-08 15:13:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-08 15:13:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-08 15:13:19,246 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-08 15:13:19,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:13:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-08 15:13:19,247 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-08 15:13:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:13:19,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:13:19,338 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:13:19,342 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:13:19,640 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-08 15:13:19,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:13:19,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:13:19,659 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:13:19,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:13:19 BoogieIcfgContainer [2024-11-08 15:13:19,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:13:19,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:13:19,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:13:19,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:13:19,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:13:18" (1/3) ... [2024-11-08 15:13:19,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551a88c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:13:19, skipping insertion in model container [2024-11-08 15:13:19,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:13:19" (2/3) ... [2024-11-08 15:13:19,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551a88c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:13:19, skipping insertion in model container [2024-11-08 15:13:19,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:13:19" (3/3) ... [2024-11-08 15:13:19,668 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product43.cil.c [2024-11-08 15:13:19,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:13:19,685 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:13:19,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:13:19,762 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;@2d6eab32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:13:19,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:13:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 71 states have internal predecessors, (90), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-08 15:13:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 15:13:19,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:19,776 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] [2024-11-08 15:13:19,776 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:19,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1972512683, now seen corresponding path program 1 times [2024-11-08 15:13:19,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:19,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316110374] [2024-11-08 15:13:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:19,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:19,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:13:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:13:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316110374] [2024-11-08 15:13:19,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316110374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:19,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:19,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 15:13:19,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030656462] [2024-11-08 15:13:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:19,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:13:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:13:19,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 15:13:19,985 INFO L87 Difference]: Start difference. First operand has 83 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 71 states have internal predecessors, (90), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-11-08 15:13:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:20,021 INFO L93 Difference]: Finished difference Result 158 states and 215 transitions. [2024-11-08 15:13:20,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:13:20,023 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23 [2024-11-08 15:13:20,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:20,031 INFO L225 Difference]: With dead ends: 158 [2024-11-08 15:13:20,031 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 15:13:20,035 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-11-08 15:13:20,038 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:20,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 15:13:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 15:13:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 63 states have internal predecessors, (76), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-08 15:13:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2024-11-08 15:13:20,137 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 23 [2024-11-08 15:13:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:20,137 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2024-11-08 15:13:20,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-11-08 15:13:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2024-11-08 15:13:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 15:13:20,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:20,140 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-11-08 15:13:20,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:13:20,141 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:20,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1628810352, now seen corresponding path program 1 times [2024-11-08 15:13:20,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:20,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480385987] [2024-11-08 15:13:20,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:13:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:13:20,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:20,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480385987] [2024-11-08 15:13:20,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480385987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:20,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:20,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:13:20,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484690054] [2024-11-08 15:13:20,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:20,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:13:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:13:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:13:20,351 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 15:13:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:20,374 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2024-11-08 15:13:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:13:20,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2024-11-08 15:13:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:20,378 INFO L225 Difference]: With dead ends: 110 [2024-11-08 15:13:20,378 INFO L226 Difference]: Without dead ends: 65 [2024-11-08 15:13:20,379 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-11-08 15:13:20,380 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 17 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:20,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:20,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-08 15:13:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-08 15:13:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 57 states have internal predecessors, (69), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 15:13:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2024-11-08 15:13:20,397 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 24 [2024-11-08 15:13:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:20,398 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-11-08 15:13:20,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 15:13:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2024-11-08 15:13:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 15:13:20,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:20,399 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] [2024-11-08 15:13:20,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:13:20,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:20,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 64763022, now seen corresponding path program 1 times [2024-11-08 15:13:20,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40911261] [2024-11-08 15:13:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:13:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:13:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:20,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40911261] [2024-11-08 15:13:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40911261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:20,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:20,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:13:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217154737] [2024-11-08 15:13:20,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:20,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:13:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:13:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:13:20,626 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-11-08 15:13:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:20,814 INFO L93 Difference]: Finished difference Result 219 states and 287 transitions. [2024-11-08 15:13:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:13:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 28 [2024-11-08 15:13:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:20,817 INFO L225 Difference]: With dead ends: 219 [2024-11-08 15:13:20,817 INFO L226 Difference]: Without dead ends: 161 [2024-11-08 15:13:20,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:13:20,819 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 191 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:20,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 355 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:13:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-08 15:13:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 151. [2024-11-08 15:13:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 129 states have internal predecessors, (160), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (19), 16 states have call predecessors, (19), 18 states have call successors, (19) [2024-11-08 15:13:20,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 197 transitions. [2024-11-08 15:13:20,843 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 197 transitions. Word has length 28 [2024-11-08 15:13:20,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:20,843 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 197 transitions. [2024-11-08 15:13:20,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-11-08 15:13:20,844 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 197 transitions. [2024-11-08 15:13:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 15:13:20,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:20,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:20,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:13:20,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:20,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:20,848 INFO L85 PathProgramCache]: Analyzing trace with hash -720213501, now seen corresponding path program 1 times [2024-11-08 15:13:20,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:20,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531986348] [2024-11-08 15:13:20,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:20,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:13:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:13:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:13:20,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531986348] [2024-11-08 15:13:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531986348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:13:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575506082] [2024-11-08 15:13:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:20,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:13:20,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:13:20,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:13:20,923 INFO L87 Difference]: Start difference. First operand 151 states and 197 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:13:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:20,972 INFO L93 Difference]: Finished difference Result 370 states and 490 transitions. [2024-11-08 15:13:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:13:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2024-11-08 15:13:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:20,975 INFO L225 Difference]: With dead ends: 370 [2024-11-08 15:13:20,975 INFO L226 Difference]: Without dead ends: 226 [2024-11-08 15:13:20,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:13:20,978 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 71 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:20,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 127 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-08 15:13:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2024-11-08 15:13:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 173 states have (on average 1.323699421965318) internal successors, (229), 188 states have internal predecessors, (229), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-11-08 15:13:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 287 transitions. [2024-11-08 15:13:21,026 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 287 transitions. Word has length 33 [2024-11-08 15:13:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:21,026 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 287 transitions. [2024-11-08 15:13:21,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:13:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 287 transitions. [2024-11-08 15:13:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 15:13:21,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:21,028 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:21,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:13:21,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:21,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash -80349629, now seen corresponding path program 1 times [2024-11-08 15:13:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367445329] [2024-11-08 15:13:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:21,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 15:13:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,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-11-08 15:13:21,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:21,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367445329] [2024-11-08 15:13:21,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367445329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:21,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:21,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:13:21,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357083401] [2024-11-08 15:13:21,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:21,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:13:21,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:21,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:13:21,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:13:21,127 INFO L87 Difference]: Start difference. First operand 224 states and 287 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-08 15:13:21,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:21,197 INFO L93 Difference]: Finished difference Result 226 states and 288 transitions. [2024-11-08 15:13:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:13:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 32 [2024-11-08 15:13:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:21,200 INFO L225 Difference]: With dead ends: 226 [2024-11-08 15:13:21,201 INFO L226 Difference]: Without dead ends: 224 [2024-11-08 15:13:21,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:13:21,202 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 66 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:21,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 276 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-08 15:13:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-08 15:13:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 173 states have (on average 1.30635838150289) internal successors, (226), 188 states have internal predecessors, (226), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-11-08 15:13:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 284 transitions. [2024-11-08 15:13:21,232 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 284 transitions. Word has length 32 [2024-11-08 15:13:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:21,233 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 284 transitions. [2024-11-08 15:13:21,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11-08 15:13:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 284 transitions. [2024-11-08 15:13:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 15:13:21,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:21,235 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:13:21,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:13:21,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:21,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1781121978, now seen corresponding path program 1 times [2024-11-08 15:13:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:21,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691161981] [2024-11-08 15:13:21,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:21,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:13:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:13:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:13:21,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:21,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691161981] [2024-11-08 15:13:21,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691161981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:21,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:21,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:13:21,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954399207] [2024-11-08 15:13:21,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:21,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:13:21,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:21,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:13:21,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:13:21,382 INFO L87 Difference]: Start difference. First operand 224 states and 284 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:13:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:21,425 INFO L93 Difference]: Finished difference Result 445 states and 577 transitions. [2024-11-08 15:13:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:13:21,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-08 15:13:21,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:21,431 INFO L225 Difference]: With dead ends: 445 [2024-11-08 15:13:21,431 INFO L226 Difference]: Without dead ends: 228 [2024-11-08 15:13:21,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:13:21,436 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:21,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-08 15:13:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-11-08 15:13:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 177 states have (on average 1.2994350282485876) internal successors, (230), 192 states have internal predecessors, (230), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-11-08 15:13:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 288 transitions. [2024-11-08 15:13:21,456 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 288 transitions. Word has length 45 [2024-11-08 15:13:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:21,457 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 288 transitions. [2024-11-08 15:13:21,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:13:21,457 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 288 transitions. [2024-11-08 15:13:21,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 15:13:21,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:21,458 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:13:21,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:13:21,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:21,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1915135484, now seen corresponding path program 1 times [2024-11-08 15:13:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497033218] [2024-11-08 15:13:21,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:21,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:13:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:13:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:13:21,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:21,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497033218] [2024-11-08 15:13:21,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497033218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:21,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:21,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:13:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079404983] [2024-11-08 15:13:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:21,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:13:21,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:21,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:13:21,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:13:21,541 INFO L87 Difference]: Start difference. First operand 228 states and 288 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:13:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:21,577 INFO L93 Difference]: Finished difference Result 455 states and 587 transitions. [2024-11-08 15:13:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:13:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-08 15:13:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:21,581 INFO L225 Difference]: With dead ends: 455 [2024-11-08 15:13:21,581 INFO L226 Difference]: Without dead ends: 234 [2024-11-08 15:13:21,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:13:21,583 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:21,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-08 15:13:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-08 15:13:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 183 states have (on average 1.289617486338798) internal successors, (236), 198 states have internal predecessors, (236), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2024-11-08 15:13:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2024-11-08 15:13:21,613 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 45 [2024-11-08 15:13:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:21,614 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2024-11-08 15:13:21,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:13:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2024-11-08 15:13:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 15:13:21,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:21,616 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:13:21,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:13:21,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1843161592, now seen corresponding path program 1 times [2024-11-08 15:13:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200642002] [2024-11-08 15:13:21,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:21,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:13:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:13:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:13:21,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:21,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200642002] [2024-11-08 15:13:21,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200642002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:21,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:21,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:13:21,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402626694] [2024-11-08 15:13:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:21,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:13:21,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:21,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:13:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:13:21,708 INFO L87 Difference]: Start difference. First operand 234 states and 294 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:13:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:21,740 INFO L93 Difference]: Finished difference Result 576 states and 733 transitions. [2024-11-08 15:13:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:13:21,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-08 15:13:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:21,747 INFO L225 Difference]: With dead ends: 576 [2024-11-08 15:13:21,748 INFO L226 Difference]: Without dead ends: 349 [2024-11-08 15:13:21,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:13:21,749 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 38 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:21,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 151 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:13:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-08 15:13:21,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-08 15:13:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 273 states have (on average 1.2637362637362637) internal successors, (345), 291 states have internal predecessors, (345), 40 states have call successors, (40), 38 states have call predecessors, (40), 35 states have return successors, (47), 37 states have call predecessors, (47), 40 states have call successors, (47) [2024-11-08 15:13:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 432 transitions. [2024-11-08 15:13:21,782 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 432 transitions. Word has length 45 [2024-11-08 15:13:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:21,784 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 432 transitions. [2024-11-08 15:13:21,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:13:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 432 transitions. [2024-11-08 15:13:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 15:13:21,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:21,786 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:13:21,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:13:21,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:21,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:21,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1920956846, now seen corresponding path program 1 times [2024-11-08 15:13:21,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:21,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929463275] [2024-11-08 15:13:21,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:21,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:13:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 15:13:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:13:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:13:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929463275] [2024-11-08 15:13:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929463275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:21,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:13:21,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:13:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994278153] [2024-11-08 15:13:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:21,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:13:21,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:21,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:13:21,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:13:21,959 INFO L87 Difference]: Start difference. First operand 349 states and 432 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:13:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:22,232 INFO L93 Difference]: Finished difference Result 1201 states and 1529 transitions. [2024-11-08 15:13:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:13:22,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-08 15:13:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:22,241 INFO L225 Difference]: With dead ends: 1201 [2024-11-08 15:13:22,241 INFO L226 Difference]: Without dead ends: 859 [2024-11-08 15:13:22,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-08 15:13:22,246 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 123 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:22,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 377 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:13:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2024-11-08 15:13:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 849. [2024-11-08 15:13:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 664 states have (on average 1.2289156626506024) internal successors, (816), 721 states have internal predecessors, (816), 100 states have call successors, (100), 76 states have call predecessors, (100), 84 states have return successors, (136), 94 states have call predecessors, (136), 100 states have call successors, (136) [2024-11-08 15:13:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1052 transitions. [2024-11-08 15:13:22,318 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1052 transitions. Word has length 49 [2024-11-08 15:13:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:22,318 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1052 transitions. [2024-11-08 15:13:22,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 15:13:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1052 transitions. [2024-11-08 15:13:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 15:13:22,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:22,320 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 15:13:22,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:13:22,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:22,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1647830990, now seen corresponding path program 1 times [2024-11-08 15:13:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:22,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498934678] [2024-11-08 15:13:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:22,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 15:13:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:13:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:22,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 15:13:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:13:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:22,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:13:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:13:22,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498934678] [2024-11-08 15:13:22,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498934678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:13:22,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139045587] [2024-11-08 15:13:22,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:22,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:13:22,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:13:22,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:13:22,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:13:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:13:22,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:13:22,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:13:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:13:22,746 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:13:22,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139045587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:13:22,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:13:22,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 16 [2024-11-08 15:13:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135466191] [2024-11-08 15:13:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:13:22,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:13:22,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:13:22,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:13:22,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-08 15:13:22,767 INFO L87 Difference]: Start difference. First operand 849 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 15:13:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:13:22,949 INFO L93 Difference]: Finished difference Result 1683 states and 2093 transitions. [2024-11-08 15:13:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:13:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2024-11-08 15:13:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:13:22,956 INFO L225 Difference]: With dead ends: 1683 [2024-11-08 15:13:22,957 INFO L226 Difference]: Without dead ends: 841 [2024-11-08 15:13:22,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:13:22,960 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 53 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:13:22,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 760 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:13:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-11-08 15:13:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 819. [2024-11-08 15:13:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 640 states have (on average 1.2125) internal successors, (776), 691 states have internal predecessors, (776), 96 states have call successors, (96), 76 states have call predecessors, (96), 82 states have return successors, (119), 90 states have call predecessors, (119), 96 states have call successors, (119) [2024-11-08 15:13:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 991 transitions. [2024-11-08 15:13:23,028 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 991 transitions. Word has length 53 [2024-11-08 15:13:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:13:23,032 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 991 transitions. [2024-11-08 15:13:23,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 15:13:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 991 transitions. [2024-11-08 15:13:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 15:13:23,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:13:23,038 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-08 15:13:23,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:13:23,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 15:13:23,239 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:13:23,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:13:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash 946658775, now seen corresponding path program 1 times [2024-11-08 15:13:23,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:13:23,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649126593] [2024-11-08 15:13:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:13:23,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:13:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:13:23,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 15:13:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 15:13:23,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 15:13:23,316 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 15:13:23,317 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:13:23,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:13:23,321 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:13:23,401 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:13:23,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:13:23 BoogieIcfgContainer [2024-11-08 15:13:23,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:13:23,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:13:23,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:13:23,405 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:13:23,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:13:19" (3/4) ... [2024-11-08 15:13:23,406 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 15:13:23,492 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:13:23,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:13:23,492 INFO L158 Benchmark]: Toolchain (without parser) took 5028.35ms. Allocated memory was 146.8MB in the beginning and 222.3MB in the end (delta: 75.5MB). Free memory was 75.3MB in the beginning and 111.6MB in the end (delta: -36.3MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-08 15:13:23,493 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 146.8MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:13:23,493 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.70ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 75.1MB in the beginning and 147.0MB in the end (delta: -71.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-08 15:13:23,493 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.97ms. Allocated memory is still 184.5MB. Free memory was 147.0MB in the beginning and 144.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:13:23,493 INFO L158 Benchmark]: Boogie Preprocessor took 41.25ms. Allocated memory is still 184.5MB. Free memory was 144.9MB in the beginning and 142.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:13:23,493 INFO L158 Benchmark]: RCFGBuilder took 517.62ms. Allocated memory is still 184.5MB. Free memory was 142.8MB in the beginning and 125.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 15:13:23,494 INFO L158 Benchmark]: TraceAbstraction took 3742.09ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 124.0MB in the beginning and 117.9MB in the end (delta: 6.1MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2024-11-08 15:13:23,494 INFO L158 Benchmark]: Witness Printer took 87.30ms. Allocated memory is still 222.3MB. Free memory was 117.9MB in the beginning and 111.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 15:13:23,495 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.21ms. Allocated memory is still 146.8MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.70ms. Allocated memory was 146.8MB in the beginning and 184.5MB in the end (delta: 37.7MB). Free memory was 75.1MB in the beginning and 147.0MB in the end (delta: -71.9MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.97ms. Allocated memory is still 184.5MB. Free memory was 147.0MB in the beginning and 144.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.25ms. Allocated memory is still 184.5MB. Free memory was 144.9MB in the beginning and 142.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 517.62ms. Allocated memory is still 184.5MB. Free memory was 142.8MB in the beginning and 125.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3742.09ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 124.0MB in the beginning and 117.9MB in the end (delta: 6.1MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 87.30ms. Allocated memory is still 222.3MB. Free memory was 117.9MB in the beginning and 111.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [150] - GenericResultAtLocation [Line: 342]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [342] - GenericResultAtLocation [Line: 410]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [410] - GenericResultAtLocation [Line: 419]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [419] - GenericResultAtLocation [Line: 445]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [445] - GenericResultAtLocation [Line: 544]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] - GenericResultAtLocation [Line: 910]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [910] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 415]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L57] int waterLevel = 1; [L58] int methaneLevelCritical = 0; [L157] int pumpRunning = 0; [L158] int systemActive = 1; [L446] int cleanupTimeShifts = 4; [L714] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L522] int retValue_acc ; [L523] int tmp ; [L527] FCALL select_helpers() [L528] FCALL select_features() [L529] CALL, EXPR valid_product() [L937] int retValue_acc ; [L940] retValue_acc = 1 [L941] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L529] RET, EXPR valid_product() [L529] tmp = valid_product() [L531] COND TRUE \read(tmp) [L533] FCALL setup() [L534] CALL runTest() [L513] CALL test() [L345] int splverifierCounter ; [L346] int tmp ; [L347] int tmp___0 ; [L348] int tmp___1 ; [L349] int tmp___2 ; [L352] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L354] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L356] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L362] tmp = __VERIFIER_nondet_int() [L364] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L366] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L75] COND TRUE waterLevel < 2 [L76] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L366] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L372] tmp___0 = __VERIFIER_nondet_int() [L374] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L382] tmp___2 = __VERIFIER_nondet_int() [L384] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L399] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L165] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L172] COND TRUE \read(systemActive) [L174] CALL processEnvironment() [L194] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L197] COND TRUE ! pumpRunning [L199] CALL, EXPR isHighWaterLevel() [L309] int retValue_acc ; [L310] int tmp ; [L311] int tmp___0 ; [L315] CALL, EXPR isHighWaterSensorDry() [L137] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(waterLevel < 2) [L144] retValue_acc = 0 [L145] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L315] RET, EXPR isHighWaterSensorDry() [L315] tmp = isHighWaterSensorDry() [L317] COND FALSE !(\read(tmp)) [L320] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L322] retValue_acc = tmp___0 [L323] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L199] RET, EXPR isHighWaterLevel() [L199] tmp = isHighWaterLevel() [L201] COND TRUE \read(tmp) [L203] CALL activatePump() [L228] int tmp ; [L232] CALL, EXPR isMethaneAlarm() [L253] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L257] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L96] int retValue_acc ; [L99] retValue_acc = methaneLevelCritical [L100] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L257] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L257] retValue_acc = isMethaneLevelCritical() [L259] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L232] RET, EXPR isMethaneAlarm() [L232] tmp = isMethaneAlarm() [L234] COND FALSE !(\read(tmp)) [L238] CALL activatePump__wrappee__highWaterSensor() [L222] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L238] RET activatePump__wrappee__highWaterSensor() [L203] RET activatePump() [L174] RET processEnvironment() [L180] CALL __utac_acc__Specification1_spec__1() [L421] int tmp ; [L422] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L426] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L96] int retValue_acc ; [L99] retValue_acc = methaneLevelCritical [L100] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L426] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L426] tmp = isMethaneLevelCritical() [L428] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L180] RET __utac_acc__Specification1_spec__1() [L399] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L354] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L356] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L362] tmp = __VERIFIER_nondet_int() [L364] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L372] tmp___0 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L376] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L87] COND FALSE !(\read(methaneLevelCritical)) [L90] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L376] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L382] tmp___2 = __VERIFIER_nondet_int() [L384] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L399] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L165] COND TRUE \read(pumpRunning) [L167] CALL lowerWaterLevel() [L63] COND TRUE waterLevel > 0 [L64] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L167] RET lowerWaterLevel() [L172] COND TRUE \read(systemActive) [L174] CALL processEnvironment() [L194] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L197] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L212] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L174] RET processEnvironment() [L180] CALL __utac_acc__Specification1_spec__1() [L421] int tmp ; [L422] int tmp___0 ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L426] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L96] int retValue_acc ; [L99] retValue_acc = methaneLevelCritical [L100] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L426] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L426] tmp = isMethaneLevelCritical() [L428] COND TRUE \read(tmp) [L430] CALL, EXPR isPumpRunning() [L264] int retValue_acc ; [L267] retValue_acc = pumpRunning [L268] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L430] RET, EXPR isPumpRunning() [L430] tmp___0 = isPumpRunning() [L432] COND TRUE \read(tmp___0) [L434] CALL __automaton_fail() [L415] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 572 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 2993 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2101 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 333 IncrementalHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 892 mSDtfsCounter, 333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=849occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 419 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 1 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 16/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 15:13:23,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE