./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.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_spec4_product37.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 e3509f37a4190025a6bf9c4e7a81c42e49e3316a9582aab003e20039c8a6c594 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:09:54,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:09:54,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:09:54,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:09:54,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:09:54,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:09:54,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:09:54,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:09:54,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:09:54,224 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:09:54,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:09:54,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:09:54,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:09:54,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:09:54,227 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:09:54,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:09:54,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:09:54,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:09:54,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:09:54,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:09:54,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:09:54,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:09:54,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:09:54,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:09:54,232 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:09:54,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:09:54,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:09:54,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:09:54,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:09:54,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:09:54,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:09:54,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:09:54,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:54,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:09:54,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:09:54,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:09:54,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:09:54,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:09:54,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:09:54,237 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:09:54,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:09:54,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:09:54,238 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 -> e3509f37a4190025a6bf9c4e7a81c42e49e3316a9582aab003e20039c8a6c594 [2024-10-14 03:09:54,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:09:54,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:09:54,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:09:54,544 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:09:54,544 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:09:54,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2024-10-14 03:09:55,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:09:56,229 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:09:56,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2024-10-14 03:09:56,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10edb302/6c2faee0dd2e46aa861e22e5f86951fd/FLAGbd8d1688d [2024-10-14 03:09:56,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10edb302/6c2faee0dd2e46aa861e22e5f86951fd [2024-10-14 03:09:56,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:09:56,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:09:56,273 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:56,273 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:09:56,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:09:56,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26025499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56, skipping insertion in model container [2024-10-14 03:09:56,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:09:56,536 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c[6698,6711] [2024-10-14 03:09:56,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:56,636 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:09:56,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-10-14 03:09:56,648 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] [2024-10-14 03:09:56,648 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [156] [2024-10-14 03:09:56,648 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [343] [2024-10-14 03:09:56,649 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [439] [2024-10-14 03:09:56,649 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [448] [2024-10-14 03:09:56,649 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [543] [2024-10-14 03:09:56,649 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [909] [2024-10-14 03:09:56,684 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c[6698,6711] [2024-10-14 03:09:56,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:09:56,749 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:09:56,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56 WrapperNode [2024-10-14 03:09:56,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:09:56,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:56,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:09:56,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:09:56,758 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:09:56" (1/1) ... [2024-10-14 03:09:56,768 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:09:56" (1/1) ... [2024-10-14 03:09:56,797 INFO L138 Inliner]: procedures = 53, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 198 [2024-10-14 03:09:56,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:09:56,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:09:56,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:09:56,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:09:56,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,837 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:09:56,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:09:56,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:09:56,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:09:56,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:09:56,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (1/1) ... [2024-10-14 03:09:56,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:09:56,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:09:56,890 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:09:56,893 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:09:56,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:09:56,968 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:09:56,968 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:09:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:09:56,969 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:09:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:09:56,969 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:09:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:09:56,969 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-14 03:09:56,969 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:09:56,969 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:09:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:09:56,970 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:09:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:09:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:09:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:09:57,069 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:09:57,072 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:09:57,361 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-14 03:09:57,364 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:09:57,428 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:09:57,428 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:09:57,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:57 BoogieIcfgContainer [2024-10-14 03:09:57,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:09:57,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:09:57,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:09:57,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:09:57,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:09:56" (1/3) ... [2024-10-14 03:09:57,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7df6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:57, skipping insertion in model container [2024-10-14 03:09:57,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:09:56" (2/3) ... [2024-10-14 03:09:57,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e7df6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:09:57, skipping insertion in model container [2024-10-14 03:09:57,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:57" (3/3) ... [2024-10-14 03:09:57,439 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product37.cil.c [2024-10-14 03:09:57,453 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:09:57,453 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:09:57,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:09:57,522 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;@67985546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:09:57,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:09:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 51 states have internal predecessors, (68), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 03:09:57,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 03:09:57,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:57,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:57,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:57,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1607235094, now seen corresponding path program 1 times [2024-10-14 03:09:57,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:57,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485842955] [2024-10-14 03:09:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:57,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,724 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:09:57,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485842955] [2024-10-14 03:09:57,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485842955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:57,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:57,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358015431] [2024-10-14 03:09:57,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:57,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:09:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:57,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:09:57,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:57,759 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 51 states have internal predecessors, (68), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:57,805 INFO L93 Difference]: Finished difference Result 120 states and 177 transitions. [2024-10-14 03:09:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:09:57,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 03:09:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:57,818 INFO L225 Difference]: With dead ends: 120 [2024-10-14 03:09:57,818 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 03:09:57,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:09:57,826 INFO L432 NwaCegarLoop]: 70 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, 70 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:09:57,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 03:09:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-14 03:09:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.45) internal successors, (58), 47 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 03:09:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-10-14 03:09:57,869 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 12 [2024-10-14 03:09:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:57,869 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-10-14 03:09:57,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-10-14 03:09:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 03:09:57,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:57,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:57,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:09:57,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:57,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash 860786997, now seen corresponding path program 1 times [2024-10-14 03:09:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:57,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630587185] [2024-10-14 03:09:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:57,968 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:09:57,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630587185] [2024-10-14 03:09:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630587185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:57,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:57,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:09:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234343929] [2024-10-14 03:09:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:57,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:57,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:57,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:57,976 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:58,024 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2024-10-14 03:09:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:58,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 03:09:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:58,027 INFO L225 Difference]: With dead ends: 85 [2024-10-14 03:09:58,028 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 03:09:58,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:58,032 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:58,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 98 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 03:09:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 03:09:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 42 states have internal predecessors, (52), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 03:09:58,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-10-14 03:09:58,048 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 13 [2024-10-14 03:09:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:58,049 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-10-14 03:09:58,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:58,049 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-10-14 03:09:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:09:58,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:58,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:58,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:09:58,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:58,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash -405548781, now seen corresponding path program 1 times [2024-10-14 03:09:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079348778] [2024-10-14 03:09:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:58,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,182 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:09:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:58,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079348778] [2024-10-14 03:09:58,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079348778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:58,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:58,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86300012] [2024-10-14 03:09:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:58,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:58,185 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:58,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:58,212 INFO L93 Difference]: Finished difference Result 94 states and 131 transitions. [2024-10-14 03:09:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:58,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 03:09:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:58,214 INFO L225 Difference]: With dead ends: 94 [2024-10-14 03:09:58,214 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 03:09:58,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:09:58,216 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:58,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:09:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 03:09:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 03:09:58,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.457142857142857) internal successors, (51), 42 states have internal predecessors, (51), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 03:09:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-10-14 03:09:58,225 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 16 [2024-10-14 03:09:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:58,225 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-14 03:09:58,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2024-10-14 03:09:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 03:09:58,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:58,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:58,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:09:58,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:58,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash 322429405, now seen corresponding path program 1 times [2024-10-14 03:09:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:58,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308889631] [2024-10-14 03:09:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:58,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,322 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:09:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308889631] [2024-10-14 03:09:58,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308889631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:58,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:58,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:09:58,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999098800] [2024-10-14 03:09:58,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:58,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:09:58,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:58,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:09:58,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:58,325 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), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:58,416 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2024-10-14 03:09:58,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:09:58,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 03:09:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:58,421 INFO L225 Difference]: With dead ends: 128 [2024-10-14 03:09:58,422 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 03:09:58,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:09:58,426 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 42 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:58,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 102 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 03:09:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-10-14 03:09:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 66 states have internal predecessors, (83), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-14 03:09:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2024-10-14 03:09:58,451 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 19 [2024-10-14 03:09:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:58,451 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2024-10-14 03:09:58,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:09:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2024-10-14 03:09:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:09:58,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:58,453 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:09:58,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:09:58,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:58,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash -956680358, now seen corresponding path program 1 times [2024-10-14 03:09:58,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:58,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836903219] [2024-10-14 03:09:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:58,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,635 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:09:58,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:58,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836903219] [2024-10-14 03:09:58,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836903219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:58,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:58,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:58,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869564100] [2024-10-14 03:09:58,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:58,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:58,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:58,643 INFO L87 Difference]: Start difference. First operand 80 states and 107 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:58,821 INFO L93 Difference]: Finished difference Result 176 states and 238 transitions. [2024-10-14 03:09:58,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:09:58,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-14 03:09:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:58,824 INFO L225 Difference]: With dead ends: 176 [2024-10-14 03:09:58,824 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 03:09:58,825 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:09:58,826 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 37 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:58,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:58,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 03:09:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-10-14 03:09:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 79 states have internal predecessors, (100), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-14 03:09:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2024-10-14 03:09:58,848 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 28 [2024-10-14 03:09:58,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:58,849 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2024-10-14 03:09:58,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2024-10-14 03:09:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:09:58,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:58,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:09:58,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:09:58,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:58,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1349707368, now seen corresponding path program 1 times [2024-10-14 03:09:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:58,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185100747] [2024-10-14 03:09:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:58,982 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:09:58,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:58,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185100747] [2024-10-14 03:09:58,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185100747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:58,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:58,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:09:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649370351] [2024-10-14 03:09:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:58,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:09:58,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:58,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:09:58,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:09:58,986 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) 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:09:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:59,157 INFO L93 Difference]: Finished difference Result 194 states and 264 transitions. [2024-10-14 03:09:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:09:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) 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:09:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:59,159 INFO L225 Difference]: With dead ends: 194 [2024-10-14 03:09:59,159 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 03:09:59,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:09:59,161 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:59,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 140 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 03:09:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-14 03:09:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 81 states have internal predecessors, (102), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (17), 11 states have call predecessors, (17), 10 states have call successors, (17) [2024-10-14 03:09:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2024-10-14 03:09:59,178 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 28 [2024-10-14 03:09:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:59,179 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2024-10-14 03:09:59,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) 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:09:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2024-10-14 03:09:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 03:09:59,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:59,180 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:09:59,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:09:59,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:59,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1091541930, now seen corresponding path program 1 times [2024-10-14 03:09:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300347699] [2024-10-14 03:09:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,275 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:09:59,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300347699] [2024-10-14 03:09:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300347699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:59,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:59,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456112461] [2024-10-14 03:09:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:59,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:59,279 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:59,581 INFO L93 Difference]: Finished difference Result 323 states and 460 transitions. [2024-10-14 03:09:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:09:59,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-14 03:09:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:59,583 INFO L225 Difference]: With dead ends: 323 [2024-10-14 03:09:59,583 INFO L226 Difference]: Without dead ends: 227 [2024-10-14 03:09:59,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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:09:59,589 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 154 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:59,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 199 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:09:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-14 03:09:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2024-10-14 03:09:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 175 states have internal predecessors, (223), 27 states have call successors, (27), 27 states have call predecessors, (27), 26 states have return successors, (51), 25 states have call predecessors, (51), 27 states have call successors, (51) [2024-10-14 03:09:59,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2024-10-14 03:09:59,643 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 28 [2024-10-14 03:09:59,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:59,644 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2024-10-14 03:09:59,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:09:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2024-10-14 03:09:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 03:09:59,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:59,649 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] [2024-10-14 03:09:59,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:09:59,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:59,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1211840511, now seen corresponding path program 1 times [2024-10-14 03:09:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:59,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315571588] [2024-10-14 03:09:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:09:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 03:09:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:09:59,750 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:09:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:09:59,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315571588] [2024-10-14 03:09:59,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315571588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:09:59,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:09:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:09:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779061772] [2024-10-14 03:09:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:09:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:09:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:09:59,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:09:59,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:09:59,753 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:09:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:09:59,913 INFO L93 Difference]: Finished difference Result 221 states and 303 transitions. [2024-10-14 03:09:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:09:59,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-14 03:09:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:09:59,917 INFO L225 Difference]: With dead ends: 221 [2024-10-14 03:09:59,920 INFO L226 Difference]: Without dead ends: 219 [2024-10-14 03:09:59,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:09:59,921 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 79 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:09:59,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 125 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:09:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-14 03:09:59,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2024-10-14 03:09:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 163 states have (on average 1.343558282208589) internal successors, (219), 175 states have internal predecessors, (219), 27 states have call successors, (27), 27 states have call predecessors, (27), 26 states have return successors, (51), 25 states have call predecessors, (51), 27 states have call successors, (51) [2024-10-14 03:09:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 297 transitions. [2024-10-14 03:09:59,963 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 297 transitions. Word has length 31 [2024-10-14 03:09:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:09:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 297 transitions. [2024-10-14 03:09:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:09:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 297 transitions. [2024-10-14 03:09:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 03:09:59,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:09:59,968 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:09:59,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:09:59,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:09:59,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:09:59,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1625044220, now seen corresponding path program 1 times [2024-10-14 03:09:59,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:09:59,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808379588] [2024-10-14 03:09:59,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:09:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:09:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:10:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:10:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,042 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:10:00,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:00,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808379588] [2024-10-14 03:10:00,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808379588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:10:00,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:10:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:10:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868944396] [2024-10-14 03:10:00,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:10:00,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:10:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:10:00,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:10:00,045 INFO L87 Difference]: Start difference. First operand 217 states and 297 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:10:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:00,368 INFO L93 Difference]: Finished difference Result 467 states and 650 transitions. [2024-10-14 03:10:00,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:10:00,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-10-14 03:10:00,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:00,371 INFO L225 Difference]: With dead ends: 467 [2024-10-14 03:10:00,371 INFO L226 Difference]: Without dead ends: 252 [2024-10-14 03:10:00,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:10:00,373 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 130 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:00,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 204 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:10:00,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-14 03:10:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2024-10-14 03:10:00,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 188 states have (on average 1.3138297872340425) internal successors, (247), 204 states have internal predecessors, (247), 30 states have call successors, (30), 27 states have call predecessors, (30), 31 states have return successors, (65), 29 states have call predecessors, (65), 30 states have call successors, (65) [2024-10-14 03:10:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 342 transitions. [2024-10-14 03:10:00,412 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 342 transitions. Word has length 32 [2024-10-14 03:10:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:00,413 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 342 transitions. [2024-10-14 03:10:00,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:10:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 342 transitions. [2024-10-14 03:10:00,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:10:00,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:00,444 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:00,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:10:00,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:00,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1095606401, now seen corresponding path program 1 times [2024-10-14 03:10:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:00,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101463685] [2024-10-14 03:10:00,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:10:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:10:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:10:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 03:10:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:10:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:00,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:10:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101463685] [2024-10-14 03:10:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101463685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:10:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047505419] [2024-10-14 03:10:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:10:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:10:00,593 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:10:00,594 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:10:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:10:00,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:10:00,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:10:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:10:00,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:10:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:10:00,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047505419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:10:00,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:10:00,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-14 03:10:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430037881] [2024-10-14 03:10:00,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:10:00,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:10:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:10:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:10:00,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:10:00,906 INFO L87 Difference]: Start difference. First operand 250 states and 342 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:10:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:10:01,367 INFO L93 Difference]: Finished difference Result 636 states and 904 transitions. [2024-10-14 03:10:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:10:01,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-14 03:10:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:10:01,370 INFO L225 Difference]: With dead ends: 636 [2024-10-14 03:10:01,370 INFO L226 Difference]: Without dead ends: 388 [2024-10-14 03:10:01,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 127 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:10:01,375 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 214 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:10:01,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 215 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:10:01,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-14 03:10:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 357. [2024-10-14 03:10:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 267 states have (on average 1.303370786516854) internal successors, (348), 289 states have internal predecessors, (348), 45 states have call successors, (45), 41 states have call predecessors, (45), 44 states have return successors, (98), 40 states have call predecessors, (98), 45 states have call successors, (98) [2024-10-14 03:10:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 491 transitions. [2024-10-14 03:10:01,413 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 491 transitions. Word has length 59 [2024-10-14 03:10:01,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:10:01,414 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 491 transitions. [2024-10-14 03:10:01,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:10:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 491 transitions. [2024-10-14 03:10:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 03:10:01,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:10:01,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:01,437 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:10:01,620 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:10:01,620 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:10:01,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:10:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash -246891748, now seen corresponding path program 2 times [2024-10-14 03:10:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:10:01,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155904744] [2024-10-14 03:10:01,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:10:01,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:10:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:10:01,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:10:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:10:01,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:10:01,699 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:10:01,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:10:01,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:10:01,705 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:10:01,770 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:10:01,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:10:01 BoogieIcfgContainer [2024-10-14 03:10:01,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:10:01,774 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:10:01,774 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:10:01,774 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:10:01,774 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:09:57" (3/4) ... [2024-10-14 03:10:01,775 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:10:01,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:10:01,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:10:01,867 INFO L158 Benchmark]: Toolchain (without parser) took 5598.03ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 110.2MB in the beginning and 149.2MB in the end (delta: -39.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:10:01,867 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:10:01,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.62ms. Allocated memory is still 163.6MB. Free memory was 109.7MB in the beginning and 89.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 03:10:01,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.22ms. Allocated memory is still 163.6MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:10:01,868 INFO L158 Benchmark]: Boogie Preprocessor took 54.50ms. Allocated memory is still 163.6MB. Free memory was 87.8MB in the beginning and 131.6MB in the end (delta: -43.9MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-10-14 03:10:01,868 INFO L158 Benchmark]: RCFGBuilder took 577.59ms. Allocated memory is still 163.6MB. Free memory was 131.6MB in the beginning and 113.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 03:10:01,869 INFO L158 Benchmark]: TraceAbstraction took 4340.57ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 156.6MB in the end (delta: -43.0MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2024-10-14 03:10:01,869 INFO L158 Benchmark]: Witness Printer took 93.07ms. Allocated memory is still 197.1MB. Free memory was 156.6MB in the beginning and 149.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:10:01,871 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.16ms. Allocated memory is still 96.5MB. Free memory is still 59.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.62ms. Allocated memory is still 163.6MB. Free memory was 109.7MB in the beginning and 89.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.22ms. Allocated memory is still 163.6MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.50ms. Allocated memory is still 163.6MB. Free memory was 87.8MB in the beginning and 131.6MB in the end (delta: -43.9MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * RCFGBuilder took 577.59ms. Allocated memory is still 163.6MB. Free memory was 131.6MB in the beginning and 113.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4340.57ms. Allocated memory was 163.6MB in the beginning and 197.1MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 156.6MB in the end (delta: -43.0MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Witness Printer took 93.07ms. Allocated memory is still 197.1MB. Free memory was 156.6MB in the beginning and 149.2MB in the end (delta: 7.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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] - GenericResultAtLocation [Line: 156]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [156] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [343] - GenericResultAtLocation [Line: 439]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [439] - GenericResultAtLocation [Line: 448]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [448] - GenericResultAtLocation [Line: 543]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [543] - GenericResultAtLocation [Line: 909]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [909] * 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: 444]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L165] int pumpRunning = 0; [L166] int systemActive = 1; [L344] int cleanupTimeShifts = 4; [L450] int waterLevel = 1; [L451] int methaneLevelCritical = 0; [L713] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L417] int retValue_acc ; [L418] int tmp ; [L422] FCALL select_helpers() [L423] FCALL select_features() [L424] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); [L424] RET, EXPR valid_product() [L424] tmp = valid_product() [L426] COND TRUE \read(tmp) [L428] FCALL setup() [L429] CALL runTest() [L411] CALL test() [L93] int splverifierCounter ; [L94] int tmp ; [L95] int tmp___0 ; [L96] int tmp___1 ; [L97] int tmp___2 ; [L100] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L104] COND TRUE splverifierCounter < 4 [L110] tmp = __VERIFIER_nondet_int() [L112] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L114] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L468] COND TRUE waterLevel < 2 [L469] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L114] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L145] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L231] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L246] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L202] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L205] COND TRUE ! pumpRunning [L207] CALL, EXPR isHighWaterLevel() [L325] int retValue_acc ; [L326] int tmp ; [L327] int tmp___0 ; [L331] CALL, EXPR isHighWaterSensorDry() [L530] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L533] COND FALSE !(waterLevel < 2) [L537] retValue_acc = 0 [L538] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L331] RET, EXPR isHighWaterSensorDry() [L331] tmp = isHighWaterSensorDry() [L333] COND FALSE !(\read(tmp)) [L336] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L338] retValue_acc = tmp___0 [L339] return (retValue_acc); [L207] RET, EXPR isHighWaterLevel() [L207] tmp = isHighWaterLevel() [L209] COND TRUE \read(tmp) [L211] CALL activatePump() [L256] pumpRunning = 1 [L211] RET activatePump() [L246] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L188] RET __utac_acc__Specification4_spec__1() [L145] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L104] COND TRUE splverifierCounter < 4 [L110] tmp = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L145] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L173] COND TRUE \read(pumpRunning) [L175] CALL lowerWaterLevel() [L456] COND TRUE waterLevel > 0 [L457] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L175] RET lowerWaterLevel() [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L231] COND TRUE \read(pumpRunning) [L233] CALL, EXPR isMethaneAlarm() [L269] int retValue_acc ; [L273] CALL, EXPR isMethaneLevelCritical() [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); [L273] RET, EXPR isMethaneLevelCritical() [L273] retValue_acc = isMethaneLevelCritical() [L275] return (retValue_acc); [L233] RET, EXPR isMethaneAlarm() [L233] tmp = isMethaneAlarm() [L235] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L241] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L202] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L205] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L220] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L241] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L188] RET __utac_acc__Specification4_spec__1() [L145] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L104] COND TRUE splverifierCounter < 4 [L110] tmp = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L145] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L173] COND TRUE \read(pumpRunning) [L175] CALL lowerWaterLevel() [L456] COND TRUE waterLevel > 0 [L457] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L175] RET lowerWaterLevel() [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L231] COND TRUE \read(pumpRunning) [L233] CALL, EXPR isMethaneAlarm() [L269] int retValue_acc ; [L273] CALL, EXPR isMethaneLevelCritical() [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); [L273] RET, EXPR isMethaneLevelCritical() [L273] retValue_acc = isMethaneLevelCritical() [L275] return (retValue_acc); [L233] RET, EXPR isMethaneAlarm() [L233] tmp = isMethaneAlarm() [L235] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L241] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L202] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L205] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L220] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L241] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND TRUE tmp == 0 [L920] CALL, EXPR isPumpRunning() [L280] int retValue_acc ; [L283] retValue_acc = pumpRunning [L284] return (retValue_acc); [L920] RET, EXPR isPumpRunning() [L920] tmp___0 = isPumpRunning() [L922] COND TRUE \read(tmp___0) [L924] CALL __automaton_fail() [L444] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 806 mSDsluCounter, 1356 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 796 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 560 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 162 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=10, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 770 SizeOfPredicates, 2 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 38/54 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:10:01,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE