./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.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 34d4dbed37590326da938d00ced1aba27649a4f6be46ad5130f0beeedcfaf5dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:08:08,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:08:08,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:08:08,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:08:08,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:08:08,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:08:08,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:08:08,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:08:08,469 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:08:08,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:08:08,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:08:08,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:08:08,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:08:08,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:08:08,472 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:08:08,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:08:08,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:08:08,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:08:08,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:08:08,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:08:08,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:08:08,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:08:08,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:08:08,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:08:08,477 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:08:08,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:08:08,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:08:08,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:08:08,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:08:08,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:08:08,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:08:08,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:08:08,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:08:08,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:08:08,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:08:08,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:08:08,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:08:08,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:08:08,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:08:08,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:08:08,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:08:08,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:08:08,481 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 -> 34d4dbed37590326da938d00ced1aba27649a4f6be46ad5130f0beeedcfaf5dd [2024-10-14 03:08:08,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:08:08,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:08:08,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:08:08,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:08:08,752 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:08:08,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2024-10-14 03:08:10,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:08:10,310 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:08:10,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c [2024-10-14 03:08:10,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463eb3a01/c024832d2a114bcb9892b19e2adca3f9/FLAG8fffd4598 [2024-10-14 03:08:10,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463eb3a01/c024832d2a114bcb9892b19e2adca3f9 [2024-10-14 03:08:10,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:08:10,336 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:08:10,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:08:10,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:08:10,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:08:10,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e6e6470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10, skipping insertion in model container [2024-10-14 03:08:10,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:08:10,631 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c[15769,15782] [2024-10-14 03:08:10,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:08:10,664 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:08:10,672 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-10-14 03:08:10,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [415] [2024-10-14 03:08:10,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [593] [2024-10-14 03:08:10,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [663] [2024-10-14 03:08:10,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [703] [2024-10-14 03:08:10,674 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [741] [2024-10-14 03:08:10,675 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [750] [2024-10-14 03:08:10,675 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [847] [2024-10-14 03:08:10,747 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product35.cil.c[15769,15782] [2024-10-14 03:08:10,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:08:10,773 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:08:10,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10 WrapperNode [2024-10-14 03:08:10,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:08:10,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:08:10,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:08:10,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:08:10,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,794 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,811 INFO L138 Inliner]: procedures = 54, calls = 96, calls flagged for inlining = 22, calls inlined = 19, statements flattened = 179 [2024-10-14 03:08:10,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:08:10,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:08:10,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:08:10,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:08:10,824 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,841 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:08:10,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:08:10,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:08:10,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:08:10,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:08:10,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (1/1) ... [2024-10-14 03:08:10,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:08:10,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:08:10,891 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-10-14 03:08:10,894 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-10-14 03:08:10,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:08:10,949 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:08:10,950 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:08:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:08:10,950 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:08:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-14 03:08:10,950 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-14 03:08:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:08:10,950 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:08:10,950 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:08:10,951 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:08:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:08:10,951 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:08:10,951 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:08:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:08:10,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:08:11,025 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:08:11,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:08:11,205 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-14 03:08:11,205 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:08:11,249 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:08:11,250 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:08:11,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:11 BoogieIcfgContainer [2024-10-14 03:08:11,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:08:11,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:08:11,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:08:11,254 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:08:11,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:08:10" (1/3) ... [2024-10-14 03:08:11,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6d3b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:08:11, skipping insertion in model container [2024-10-14 03:08:11,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:10" (2/3) ... [2024-10-14 03:08:11,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6d3b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:08:11, skipping insertion in model container [2024-10-14 03:08:11,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:11" (3/3) ... [2024-10-14 03:08:11,257 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product35.cil.c [2024-10-14 03:08:11,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:08:11,270 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:08:11,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:08:11,323 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;@2676f79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:08:11,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:08:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 50 states have internal predecessors, (69), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 03:08:11,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 03:08:11,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:11,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1932835037, now seen corresponding path program 1 times [2024-10-14 03:08:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70646542] [2024-10-14 03:08:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:08:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:11,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70646542] [2024-10-14 03:08:11,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70646542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:11,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:11,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:08:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808016343] [2024-10-14 03:08:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:11,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:08:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:11,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:08:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:08:11,522 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 50 states have internal predecessors, (69), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:11,569 INFO L93 Difference]: Finished difference Result 120 states and 175 transitions. [2024-10-14 03:08:11,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:08:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-14 03:08:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:11,577 INFO L225 Difference]: With dead ends: 120 [2024-10-14 03:08:11,578 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 03:08:11,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:08:11,583 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:11,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 03:08:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 03:08:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 46 states have internal predecessors, (59), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-14 03:08:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2024-10-14 03:08:11,613 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 17 [2024-10-14 03:08:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:11,614 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2024-10-14 03:08:11,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2024-10-14 03:08:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 03:08:11,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:11,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:08:11,616 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,617 INFO L85 PathProgramCache]: Analyzing trace with hash -622512801, now seen corresponding path program 1 times [2024-10-14 03:08:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583020916] [2024-10-14 03:08:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:08:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:11,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583020916] [2024-10-14 03:08:11,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583020916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:11,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:11,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722728930] [2024-10-14 03:08:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:11,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:11,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:11,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:11,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:11,710 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:11,738 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2024-10-14 03:08:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:11,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-14 03:08:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:11,740 INFO L225 Difference]: With dead ends: 83 [2024-10-14 03:08:11,740 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 03:08:11,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:11,742 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:11,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 03:08:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 03:08:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 41 states have internal predecessors, (53), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 03:08:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-10-14 03:08:11,749 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 18 [2024-10-14 03:08:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:11,749 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-14 03:08:11,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2024-10-14 03:08:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 03:08:11,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:11,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:08:11,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,751 INFO L85 PathProgramCache]: Analyzing trace with hash 611075093, now seen corresponding path program 1 times [2024-10-14 03:08:11,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900603777] [2024-10-14 03:08:11,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:08:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:11,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:11,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900603777] [2024-10-14 03:08:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900603777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:11,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:11,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627825528] [2024-10-14 03:08:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:11,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:11,869 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:11,920 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2024-10-14 03:08:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:11,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-14 03:08:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:11,922 INFO L225 Difference]: With dead ends: 140 [2024-10-14 03:08:11,922 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 03:08:11,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:11,924 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:11,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 118 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 03:08:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-10-14 03:08:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 76 states have internal predecessors, (99), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 03:08:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 123 transitions. [2024-10-14 03:08:11,937 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 123 transitions. Word has length 21 [2024-10-14 03:08:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:11,938 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 123 transitions. [2024-10-14 03:08:11,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 123 transitions. [2024-10-14 03:08:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 03:08:11,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:11,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:11,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:08:11,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:11,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1823951154, now seen corresponding path program 1 times [2024-10-14 03:08:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683856417] [2024-10-14 03:08:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:08:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683856417] [2024-10-14 03:08:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683856417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:12,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:12,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:12,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045004605] [2024-10-14 03:08:12,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:12,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:12,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:12,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:12,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:12,072 INFO L87 Difference]: Start difference. First operand 90 states and 123 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:12,146 INFO L93 Difference]: Finished difference Result 243 states and 337 transitions. [2024-10-14 03:08:12,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:08:12,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-14 03:08:12,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:12,149 INFO L225 Difference]: With dead ends: 243 [2024-10-14 03:08:12,149 INFO L226 Difference]: Without dead ends: 155 [2024-10-14 03:08:12,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:08:12,151 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:12,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-14 03:08:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-14 03:08:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 114 states have (on average 1.412280701754386) internal successors, (161), 125 states have internal predecessors, (161), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-10-14 03:08:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions. [2024-10-14 03:08:12,172 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 24 [2024-10-14 03:08:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:12,172 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions. [2024-10-14 03:08:12,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions. [2024-10-14 03:08:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:08:12,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:12,174 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-10-14 03:08:12,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:08:12,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 586204069, now seen corresponding path program 1 times [2024-10-14 03:08:12,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:12,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767572758] [2024-10-14 03:08:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:12,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:08:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:12,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:12,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767572758] [2024-10-14 03:08:12,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767572758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:12,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:12,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:12,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69110636] [2024-10-14 03:08:12,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:12,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:12,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:12,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:12,249 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:12,298 INFO L93 Difference]: Finished difference Result 312 states and 418 transitions. [2024-10-14 03:08:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:08:12,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 28 [2024-10-14 03:08:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:12,300 INFO L225 Difference]: With dead ends: 312 [2024-10-14 03:08:12,301 INFO L226 Difference]: Without dead ends: 159 [2024-10-14 03:08:12,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:12,302 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:12,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:12,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-14 03:08:12,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-10-14 03:08:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 129 states have internal predecessors, (165), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-10-14 03:08:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 209 transitions. [2024-10-14 03:08:12,317 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 209 transitions. Word has length 28 [2024-10-14 03:08:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:12,321 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 209 transitions. [2024-10-14 03:08:12,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 209 transitions. [2024-10-14 03:08:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:08:12,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:12,322 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-10-14 03:08:12,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:08:12,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:12,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:12,323 INFO L85 PathProgramCache]: Analyzing trace with hash -601945, now seen corresponding path program 1 times [2024-10-14 03:08:12,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:12,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268888369] [2024-10-14 03:08:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:08:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:12,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:12,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268888369] [2024-10-14 03:08:12,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268888369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:12,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:12,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:08:12,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088049264] [2024-10-14 03:08:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:12,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:08:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:12,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:08:12,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:08:12,399 INFO L87 Difference]: Start difference. First operand 159 states and 209 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-10-14 03:08:12,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:12,470 INFO L93 Difference]: Finished difference Result 325 states and 435 transitions. [2024-10-14 03:08:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:08:12,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-10-14 03:08:12,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:12,472 INFO L225 Difference]: With dead ends: 325 [2024-10-14 03:08:12,473 INFO L226 Difference]: Without dead ends: 168 [2024-10-14 03:08:12,474 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-10-14 03:08:12,475 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 54 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:12,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 223 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-14 03:08:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 163. [2024-10-14 03:08:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 122 states have (on average 1.3852459016393444) internal successors, (169), 133 states have internal predecessors, (169), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2024-10-14 03:08:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 213 transitions. [2024-10-14 03:08:12,501 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 213 transitions. Word has length 28 [2024-10-14 03:08:12,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:12,502 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 213 transitions. [2024-10-14 03:08:12,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-10-14 03:08:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 213 transitions. [2024-10-14 03:08:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:08:12,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:12,503 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-10-14 03:08:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:08:12,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:12,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1280465623, now seen corresponding path program 1 times [2024-10-14 03:08:12,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:12,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165059340] [2024-10-14 03:08:12,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:12,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:08:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:12,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:12,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165059340] [2024-10-14 03:08:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165059340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:12,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:12,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755894537] [2024-10-14 03:08:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:12,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:12,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:12,567 INFO L87 Difference]: Start difference. First operand 163 states and 213 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-10-14 03:08:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:12,612 INFO L93 Difference]: Finished difference Result 398 states and 523 transitions. [2024-10-14 03:08:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-10-14 03:08:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:12,614 INFO L225 Difference]: With dead ends: 398 [2024-10-14 03:08:12,616 INFO L226 Difference]: Without dead ends: 237 [2024-10-14 03:08:12,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:12,617 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 33 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:12,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 102 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-14 03:08:12,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-10-14 03:08:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 178 states have (on average 1.3370786516853932) internal successors, (238), 191 states have internal predecessors, (238), 30 states have call successors, (30), 30 states have call predecessors, (30), 28 states have return successors, (34), 28 states have call predecessors, (34), 30 states have call successors, (34) [2024-10-14 03:08:12,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 302 transitions. [2024-10-14 03:08:12,648 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 302 transitions. Word has length 28 [2024-10-14 03:08:12,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:12,648 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 302 transitions. [2024-10-14 03:08:12,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-10-14 03:08:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 302 transitions. [2024-10-14 03:08:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:08:12,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:12,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:12,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:08:12,653 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:12,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1160097871, now seen corresponding path program 1 times [2024-10-14 03:08:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:12,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712482119] [2024-10-14 03:08:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 03:08:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712482119] [2024-10-14 03:08:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712482119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:12,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:12,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639001845] [2024-10-14 03:08:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:12,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:12,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:12,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:12,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:12,707 INFO L87 Difference]: Start difference. First operand 237 states and 302 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:12,850 INFO L93 Difference]: Finished difference Result 493 states and 658 transitions. [2024-10-14 03:08:12,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:08:12,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 3 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 32 [2024-10-14 03:08:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:12,854 INFO L225 Difference]: With dead ends: 493 [2024-10-14 03:08:12,854 INFO L226 Difference]: Without dead ends: 491 [2024-10-14 03:08:12,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:08:12,855 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 103 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:12,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 124 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-14 03:08:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 429. [2024-10-14 03:08:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 329 states have (on average 1.3677811550151975) internal successors, (450), 360 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (81), 50 states have call predecessors, (81), 53 states have call successors, (81) [2024-10-14 03:08:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 584 transitions. [2024-10-14 03:08:12,890 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 584 transitions. Word has length 32 [2024-10-14 03:08:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:12,891 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 584 transitions. [2024-10-14 03:08:12,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:12,891 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 584 transitions. [2024-10-14 03:08:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 03:08:12,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:12,893 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:08:12,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:08:12,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1381756010, now seen corresponding path program 1 times [2024-10-14 03:08:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35976903] [2024-10-14 03:08:12,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:12,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:08:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:08:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 03:08:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:08:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35976903] [2024-10-14 03:08:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35976903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:08:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664751991] [2024-10-14 03:08:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:12,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:08:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:12,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:08:12,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:08:12,951 INFO L87 Difference]: Start difference. First operand 429 states and 584 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 03:08:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:13,158 INFO L93 Difference]: Finished difference Result 523 states and 709 transitions. [2024-10-14 03:08:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:08:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 57 [2024-10-14 03:08:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:13,160 INFO L225 Difference]: With dead ends: 523 [2024-10-14 03:08:13,161 INFO L226 Difference]: Without dead ends: 234 [2024-10-14 03:08:13,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:08:13,163 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 143 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:13,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 190 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:13,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-14 03:08:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 212. [2024-10-14 03:08:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 178 states have internal predecessors, (214), 26 states have call successors, (26), 20 states have call predecessors, (26), 23 states have return successors, (39), 25 states have call predecessors, (39), 26 states have call successors, (39) [2024-10-14 03:08:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 279 transitions. [2024-10-14 03:08:13,182 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 279 transitions. Word has length 57 [2024-10-14 03:08:13,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:13,183 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 279 transitions. [2024-10-14 03:08:13,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-14 03:08:13,183 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 279 transitions. [2024-10-14 03:08:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:08:13,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:13,186 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:13,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:08:13,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:13,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 998933324, now seen corresponding path program 1 times [2024-10-14 03:08:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:13,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146368260] [2024-10-14 03:08:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:08:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:08:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 03:08:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 03:08:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 03:08:13,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:13,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146368260] [2024-10-14 03:08:13,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146368260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:08:13,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910085899] [2024-10-14 03:08:13,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:13,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:08:13,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:08:13,357 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-10-14 03:08:13,359 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-10-14 03:08:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:13,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 03:08:13,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:08:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 03:08:13,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:08:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:08:13,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910085899] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 03:08:13,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:08:13,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 5] total 13 [2024-10-14 03:08:13,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170798363] [2024-10-14 03:08:13,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:13,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:08:13,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:13,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:08:13,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:08:13,672 INFO L87 Difference]: Start difference. First operand 212 states and 279 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:08:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:13,784 INFO L93 Difference]: Finished difference Result 604 states and 815 transitions. [2024-10-14 03:08:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:08:13,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-10-14 03:08:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:13,786 INFO L225 Difference]: With dead ends: 604 [2024-10-14 03:08:13,787 INFO L226 Difference]: Without dead ends: 394 [2024-10-14 03:08:13,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:08:13,788 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 31 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:13,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 234 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-14 03:08:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 354. [2024-10-14 03:08:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 267 states have (on average 1.2734082397003745) internal successors, (340), 294 states have internal predecessors, (340), 45 states have call successors, (45), 35 states have call predecessors, (45), 41 states have return successors, (67), 43 states have call predecessors, (67), 45 states have call successors, (67) [2024-10-14 03:08:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 452 transitions. [2024-10-14 03:08:13,813 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 452 transitions. Word has length 59 [2024-10-14 03:08:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:13,813 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 452 transitions. [2024-10-14 03:08:13,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:08:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 452 transitions. [2024-10-14 03:08:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:08:13,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:13,815 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:13,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:08:14,018 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-10-14 03:08:14,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:14,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash -500240120, now seen corresponding path program 1 times [2024-10-14 03:08:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383152310] [2024-10-14 03:08:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:08:14,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:08:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:08:14,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:08:14,058 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:08:14,059 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:08:14,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:08:14,062 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:14,111 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:08:14,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:08:14 BoogieIcfgContainer [2024-10-14 03:08:14,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:08:14,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:08:14,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:08:14,115 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:08:14,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:11" (3/4) ... [2024-10-14 03:08:14,116 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:08:14,172 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:08:14,172 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:08:14,173 INFO L158 Benchmark]: Toolchain (without parser) took 3836.86ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 93.0MB in the beginning and 61.6MB in the end (delta: 31.4MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2024-10-14 03:08:14,174 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory was 57.4MB in the beginning and 57.3MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:08:14,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.14ms. Allocated memory is still 146.8MB. Free memory was 92.5MB in the beginning and 114.8MB in the end (delta: -22.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-14 03:08:14,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.41ms. Allocated memory is still 146.8MB. Free memory was 114.0MB in the beginning and 112.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:08:14,174 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 146.8MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:08:14,175 INFO L158 Benchmark]: RCFGBuilder took 392.01ms. Allocated memory is still 146.8MB. Free memory was 109.8MB in the beginning and 97.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 03:08:14,175 INFO L158 Benchmark]: TraceAbstraction took 2862.28ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 97.5MB in the beginning and 67.9MB in the end (delta: 29.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2024-10-14 03:08:14,175 INFO L158 Benchmark]: Witness Printer took 57.63ms. Allocated memory is still 188.7MB. Free memory was 67.9MB in the beginning and 61.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:08:14,176 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.14ms. Allocated memory is still 96.5MB. Free memory was 57.4MB in the beginning and 57.3MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.14ms. Allocated memory is still 146.8MB. Free memory was 92.5MB in the beginning and 114.8MB in the end (delta: -22.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.41ms. Allocated memory is still 146.8MB. Free memory was 114.0MB in the beginning and 112.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 146.8MB. Free memory was 111.9MB in the beginning and 109.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 392.01ms. Allocated memory is still 146.8MB. Free memory was 109.8MB in the beginning and 97.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2862.28ms. Allocated memory was 146.8MB in the beginning and 188.7MB in the end (delta: 41.9MB). Free memory was 97.5MB in the beginning and 67.9MB in the end (delta: 29.6MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. * Witness Printer took 57.63ms. Allocated memory is still 188.7MB. Free memory was 67.9MB in the beginning and 61.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,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [415] - GenericResultAtLocation [Line: 593]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [593] - GenericResultAtLocation [Line: 663]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [663] - GenericResultAtLocation [Line: 703]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [703] - GenericResultAtLocation [Line: 741]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [741] - GenericResultAtLocation [Line: 750]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [750] - GenericResultAtLocation [Line: 847]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [847] * 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: 746]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L426] int pumpRunning = 0; [L427] int systemActive = 1; [L665] int methAndRunningLastTime ; [L751] int cleanupTimeShifts = 4; [L849] int waterLevel = 1; [L850] int methaneLevelCritical = 0; [L825] int retValue_acc ; [L826] int tmp ; [L830] FCALL select_helpers() [L831] FCALL select_features() [L832] CALL, EXPR valid_product() [L733] int retValue_acc ; [L736] retValue_acc = 1 [L737] return (retValue_acc); [L832] RET, EXPR valid_product() [L832] tmp = valid_product() [L834] COND TRUE \read(tmp) [L836] FCALL setup() [L837] CALL runTest() [L818] CALL __utac_acc__Specification2_spec__1() [L670] methAndRunningLastTime = 0 [L818] RET __utac_acc__Specification2_spec__1() [L819] CALL test() [L598] int splverifierCounter ; [L599] int tmp ; [L600] int tmp___0 ; [L601] int tmp___1 ; [L602] int tmp___2 ; [L605] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L607] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L609] COND TRUE splverifierCounter < 4 [L615] tmp = __VERIFIER_nondet_int() [L617] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L619] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L867] COND TRUE waterLevel < 2 [L868] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L619] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L625] tmp___0 = __VERIFIER_nondet_int() [L627] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L629] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L879] COND FALSE !(\read(methaneLevelCritical)) [L882] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L629] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L635] tmp___2 = __VERIFIER_nondet_int() [L637] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L652] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L434] COND FALSE !(\read(pumpRunning)) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L441] COND TRUE \read(systemActive) [L443] CALL processEnvironment() [L463] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L466] COND TRUE ! pumpRunning [L468] CALL, EXPR isHighWaterLevel() [L560] int retValue_acc ; [L561] int tmp ; [L562] int tmp___0 ; [L566] CALL, EXPR isHighWaterSensorDry() [L929] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L932] COND FALSE !(waterLevel < 2) [L936] retValue_acc = 0 [L937] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L566] RET, EXPR isHighWaterSensorDry() [L566] tmp = isHighWaterSensorDry() [L568] COND FALSE !(\read(tmp)) [L571] tmp___0 = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L573] retValue_acc = tmp___0 [L574] return (retValue_acc); [L468] RET, EXPR isHighWaterLevel() [L468] tmp = isHighWaterLevel() [L470] COND TRUE \read(tmp) [L472] CALL activatePump() [L491] pumpRunning = 1 [L472] RET activatePump() [L443] RET processEnvironment() [L449] CALL __utac_acc__Specification2_spec__2() [L675] int tmp ; [L676] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L888] int retValue_acc ; [L891] retValue_acc = methaneLevelCritical [L892] return (retValue_acc); [L680] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L680] tmp = isMethaneLevelCritical() [L682] COND TRUE \read(tmp) [L684] CALL, EXPR isPumpRunning() [L515] int retValue_acc ; [L518] retValue_acc = pumpRunning [L519] return (retValue_acc); [L684] RET, EXPR isPumpRunning() [L684] tmp___0 = isPumpRunning() [L686] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L687] COND FALSE !(\read(methAndRunningLastTime)) [L692] methAndRunningLastTime = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L449] RET __utac_acc__Specification2_spec__2() [L652] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L607] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L609] COND TRUE splverifierCounter < 4 [L615] tmp = __VERIFIER_nondet_int() [L617] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L625] tmp___0 = __VERIFIER_nondet_int() [L627] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L635] tmp___2 = __VERIFIER_nondet_int() [L637] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L652] CALL timeShift() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L434] COND TRUE \read(pumpRunning) [L436] CALL lowerWaterLevel() [L855] COND TRUE waterLevel > 0 [L856] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L436] RET lowerWaterLevel() [L441] COND TRUE \read(systemActive) [L443] CALL processEnvironment() [L463] int tmp ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L466] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L481] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L443] RET processEnvironment() [L449] CALL __utac_acc__Specification2_spec__2() [L675] int tmp ; [L676] int tmp___0 ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L888] int retValue_acc ; [L891] retValue_acc = methaneLevelCritical [L892] return (retValue_acc); [L680] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L680] tmp = isMethaneLevelCritical() [L682] COND TRUE \read(tmp) [L684] CALL, EXPR isPumpRunning() [L515] int retValue_acc ; [L518] retValue_acc = pumpRunning [L519] return (retValue_acc); [L684] RET, EXPR isPumpRunning() [L684] tmp___0 = isPumpRunning() [L686] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L687] COND TRUE \read(methAndRunningLastTime) [L689] CALL __automaton_fail() [L746] reach_error() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 477 mSDsluCounter, 1456 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 886 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 532 IncrementalHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 570 mSDtfsCounter, 532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 202 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=8, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 133 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 418 ConstructedInterpolants, 0 QuantifiedInterpolants, 850 SizeOfPredicates, 1 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 75/78 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 03:08:14,203 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