./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_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_product38.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 dfe9857e69a888cdbad1416d1b07f69e8062222f8bcfc0bd9dc9f4a773a0fc6f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:41:53,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:41:53,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:41:53,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:41:53,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:41:53,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:41:53,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:41:53,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:41:53,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:41:53,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:41:53,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:41:53,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:41:53,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:41:53,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:41:53,863 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:41:53,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:41:53,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:41:53,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:41:53,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:41:53,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:41:53,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:41:53,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:41:53,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:41:53,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:41:53,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:41:53,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:41:53,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:41:53,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:41:53,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:41:53,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:41:53,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:41:53,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:41:53,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:41:53,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:41:53,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:41:53,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:41:53,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:41:53,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:41:53,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:41:53,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:41:53,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:41:53,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:41:53,869 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 -> dfe9857e69a888cdbad1416d1b07f69e8062222f8bcfc0bd9dc9f4a773a0fc6f [2024-10-12 19:41:54,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:41:54,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:41:54,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:41:54,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:41:54,125 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:41:54,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2024-10-12 19:41:55,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:41:55,828 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:41:55,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product38.cil.c [2024-10-12 19:41:55,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b85a231c/5605f192f7264ccca2299946bbbe0b6d/FLAG705cb3786 [2024-10-12 19:41:55,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b85a231c/5605f192f7264ccca2299946bbbe0b6d [2024-10-12 19:41:55,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:41:55,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:41:55,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:41:55,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:41:55,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:41:55,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:41:55" (1/1) ... [2024-10-12 19:41:55,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62effa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:55, skipping insertion in model container [2024-10-12 19:41:55,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:41:55" (1/1) ... [2024-10-12 19:41:55,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:41:56,154 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_product38.cil.c[4301,4314] [2024-10-12 19:41:56,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:41:56,250 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:41:56,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] [2024-10-12 19:41:56,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [153] [2024-10-12 19:41:56,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [252] [2024-10-12 19:41:56,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [261] [2024-10-12 19:41:56,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [288] [2024-10-12 19:41:56,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [356] [2024-10-12 19:41:56,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] [2024-10-12 19:41:56,260 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [910] [2024-10-12 19:41:56,276 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_product38.cil.c[4301,4314] [2024-10-12 19:41:56,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:41:56,347 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:41:56,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56 WrapperNode [2024-10-12 19:41:56,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:41:56,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:41:56,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:41:56,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:41:56,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,368 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,392 INFO L138 Inliner]: procedures = 54, calls = 98, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 201 [2024-10-12 19:41:56,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:41:56,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:41:56,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:41:56,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:41:56,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,426 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-12 19:41:56,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:41:56,447 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:41:56,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:41:56,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:41:56,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (1/1) ... [2024-10-12 19:41:56,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:41:56,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:41:56,480 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-12 19:41:56,484 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-12 19:41:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:41:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-12 19:41:56,526 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-12 19:41:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:41:56,526 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:41:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:41:56,526 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:41:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:41:56,526 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-10-12 19:41:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-12 19:41:56,527 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-12 19:41:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:41:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-12 19:41:56,527 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-12 19:41:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:41:56,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:41:56,584 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:41:56,586 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:41:56,774 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-10-12 19:41:56,774 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:41:56,821 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:41:56,822 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 19:41:56,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:56 BoogieIcfgContainer [2024-10-12 19:41:56,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:41:56,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:41:56,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:41:56,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:41:56,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:41:55" (1/3) ... [2024-10-12 19:41:56,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8234ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:41:56, skipping insertion in model container [2024-10-12 19:41:56,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:41:56" (2/3) ... [2024-10-12 19:41:56,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8234ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:41:56, skipping insertion in model container [2024-10-12 19:41:56,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:56" (3/3) ... [2024-10-12 19:41:56,834 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product38.cil.c [2024-10-12 19:41:56,847 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:41:56,847 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:41:56,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:41:56,896 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;@3b2dfa87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:41:56,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:41:56,900 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-12 19:41:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 19:41:56,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:56,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:56,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:56,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2043448775, now seen corresponding path program 1 times [2024-10-12 19:41:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869952199] [2024-10-12 19:41:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:57,173 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-12 19:41:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869952199] [2024-10-12 19:41:57,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869952199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:57,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:57,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:41:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547386527] [2024-10-12 19:41:57,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:57,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:41:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:57,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:41:57,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:41:57,227 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-12 19:41:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:57,293 INFO L93 Difference]: Finished difference Result 120 states and 177 transitions. [2024-10-12 19:41:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:41:57,296 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-12 19:41:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:57,304 INFO L225 Difference]: With dead ends: 120 [2024-10-12 19:41:57,304 INFO L226 Difference]: Without dead ends: 56 [2024-10-12 19:41:57,308 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-12 19:41:57,312 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:57,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:57,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-12 19:41:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-12 19:41:57,349 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-12 19:41:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-10-12 19:41:57,352 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 12 [2024-10-12 19:41:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:57,353 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-10-12 19:41:57,353 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-12 19:41:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-10-12 19:41:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 19:41:57,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:57,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:57,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:41:57,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:57,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:57,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2113775194, now seen corresponding path program 1 times [2024-10-12 19:41:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671770189] [2024-10-12 19:41:57,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:57,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:57,428 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-12 19:41:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:57,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671770189] [2024-10-12 19:41:57,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671770189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:57,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:57,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:57,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985386177] [2024-10-12 19:41:57,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:57,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:57,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:57,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:57,431 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-12 19:41:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:57,457 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2024-10-12 19:41:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:57,458 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-12 19:41:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:57,459 INFO L225 Difference]: With dead ends: 85 [2024-10-12 19:41:57,459 INFO L226 Difference]: Without dead ends: 48 [2024-10-12 19:41:57,459 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-12 19:41:57,460 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:57,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 97 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-12 19:41:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-12 19:41:57,466 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-12 19:41:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2024-10-12 19:41:57,467 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 13 [2024-10-12 19:41:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:57,467 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2024-10-12 19:41:57,468 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-12 19:41:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2024-10-12 19:41:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:41:57,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:57,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:41:57,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:41:57,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:57,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:57,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1483533769, now seen corresponding path program 1 times [2024-10-12 19:41:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:57,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930829864] [2024-10-12 19:41:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:57,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:57,661 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-12 19:41:57,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:57,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930829864] [2024-10-12 19:41:57,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930829864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:57,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:41:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016695548] [2024-10-12 19:41:57,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:57,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:57,663 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), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:41:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:57,718 INFO L93 Difference]: Finished difference Result 94 states and 131 transitions. [2024-10-12 19:41:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:57,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-12 19:41:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:57,720 INFO L225 Difference]: With dead ends: 94 [2024-10-12 19:41:57,720 INFO L226 Difference]: Without dead ends: 48 [2024-10-12 19:41:57,720 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-12 19:41:57,721 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:57,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 53 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:57,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-12 19:41:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-12 19:41:57,726 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-12 19:41:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2024-10-12 19:41:57,727 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 16 [2024-10-12 19:41:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:57,727 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2024-10-12 19:41:57,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:41:57,728 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2024-10-12 19:41:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 19:41:57,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:57,728 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-12 19:41:57,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:41:57,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:57,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash -457071425, now seen corresponding path program 1 times [2024-10-12 19:41:57,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:57,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641801584] [2024-10-12 19:41:57,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:57,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:57,815 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-12 19:41:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641801584] [2024-10-12 19:41:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641801584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:57,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:41:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276071903] [2024-10-12 19:41:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:57,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:41:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:41:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:41:57,818 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-12 19:41:57,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:57,873 INFO L93 Difference]: Finished difference Result 128 states and 177 transitions. [2024-10-12 19:41:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:41:57,874 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-12 19:41:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:57,875 INFO L225 Difference]: With dead ends: 128 [2024-10-12 19:41:57,877 INFO L226 Difference]: Without dead ends: 82 [2024-10-12 19:41:57,877 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-12 19:41:57,878 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:57,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 100 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:41:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-12 19:41:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-10-12 19:41:57,901 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-12 19:41:57,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 107 transitions. [2024-10-12 19:41:57,904 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 107 transitions. Word has length 19 [2024-10-12 19:41:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:57,905 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 107 transitions. [2024-10-12 19:41:57,905 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-12 19:41:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 107 transitions. [2024-10-12 19:41:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 19:41:57,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:57,907 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-12 19:41:57,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:41:57,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 94838812, now seen corresponding path program 1 times [2024-10-12 19:41:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:57,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36045057] [2024-10-12 19:41:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:57,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:57,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,023 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-12 19:41:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36045057] [2024-10-12 19:41:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36045057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:58,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:58,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104519212] [2024-10-12 19:41:58,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:58,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:58,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:58,028 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-12 19:41:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:58,156 INFO L93 Difference]: Finished difference Result 176 states and 242 transitions. [2024-10-12 19:41:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:41:58,157 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-12 19:41:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:58,158 INFO L225 Difference]: With dead ends: 176 [2024-10-12 19:41:58,158 INFO L226 Difference]: Without dead ends: 98 [2024-10-12 19:41:58,158 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-12 19:41:58,159 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:58,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 142 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-12 19:41:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-10-12 19:41:58,175 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-12 19:41:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2024-10-12 19:41:58,176 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 28 [2024-10-12 19:41:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:58,177 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2024-10-12 19:41:58,177 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-12 19:41:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2024-10-12 19:41:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 19:41:58,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:58,179 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-12 19:41:58,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:41:58,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:58,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 487865822, now seen corresponding path program 1 times [2024-10-12 19:41:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260592853] [2024-10-12 19:41:58,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,259 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-12 19:41:58,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:58,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260592853] [2024-10-12 19:41:58,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260592853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:58,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:58,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248518711] [2024-10-12 19:41:58,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:58,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:58,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:58,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:58,264 INFO L87 Difference]: Start difference. First operand 96 states and 127 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-12 19:41:58,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:58,354 INFO L93 Difference]: Finished difference Result 194 states and 260 transitions. [2024-10-12 19:41:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:41:58,355 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-12 19:41:58,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:58,356 INFO L225 Difference]: With dead ends: 194 [2024-10-12 19:41:58,356 INFO L226 Difference]: Without dead ends: 100 [2024-10-12 19:41:58,356 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-12 19:41:58,357 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 37 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:58,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 145 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-12 19:41:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-12 19:41:58,365 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-12 19:41:58,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2024-10-12 19:41:58,366 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 28 [2024-10-12 19:41:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:58,366 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2024-10-12 19:41:58,366 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-12 19:41:58,367 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2024-10-12 19:41:58,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 19:41:58,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:58,367 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-12 19:41:58,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:41:58,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:58,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash 353004250, now seen corresponding path program 1 times [2024-10-12 19:41:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:58,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857788192] [2024-10-12 19:41:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,415 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-12 19:41:58,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:58,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857788192] [2024-10-12 19:41:58,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857788192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:58,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691334669] [2024-10-12 19:41:58,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:58,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:58,417 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-12 19:41:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:58,590 INFO L93 Difference]: Finished difference Result 323 states and 460 transitions. [2024-10-12 19:41:58,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:58,590 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-12 19:41:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:58,592 INFO L225 Difference]: With dead ends: 323 [2024-10-12 19:41:58,592 INFO L226 Difference]: Without dead ends: 227 [2024-10-12 19:41:58,593 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-12 19:41:58,593 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 154 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:58,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 190 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-10-12 19:41:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 217. [2024-10-12 19:41:58,617 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-12 19:41:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2024-10-12 19:41:58,619 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 28 [2024-10-12 19:41:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:58,619 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2024-10-12 19:41:58,619 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-12 19:41:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2024-10-12 19:41:58,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 19:41:58,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:58,620 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-12 19:41:58,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:41:58,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:58,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1770385780, now seen corresponding path program 1 times [2024-10-12 19:41:58,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:58,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662695692] [2024-10-12 19:41:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:41:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,682 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-12 19:41:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662695692] [2024-10-12 19:41:58,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662695692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:58,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:58,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:41:58,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113763316] [2024-10-12 19:41:58,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:58,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:41:58,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:58,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:41:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:41:58,684 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-12 19:41:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:58,793 INFO L93 Difference]: Finished difference Result 221 states and 303 transitions. [2024-10-12 19:41:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:41:58,793 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-12 19:41:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:58,795 INFO L225 Difference]: With dead ends: 221 [2024-10-12 19:41:58,795 INFO L226 Difference]: Without dead ends: 219 [2024-10-12 19:41:58,795 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-12 19:41:58,796 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 79 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:58,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 121 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:41:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-12 19:41:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2024-10-12 19:41:58,833 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-12 19:41:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 297 transitions. [2024-10-12 19:41:58,836 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 297 transitions. Word has length 31 [2024-10-12 19:41:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:58,838 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 297 transitions. [2024-10-12 19:41:58,839 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-12 19:41:58,839 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 297 transitions. [2024-10-12 19:41:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 19:41:58,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:58,839 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-12 19:41:58,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:41:58,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:58,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash -791496192, now seen corresponding path program 1 times [2024-10-12 19:41:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:58,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632894661] [2024-10-12 19:41:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:41:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:58,898 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-12 19:41:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:58,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632894661] [2024-10-12 19:41:58,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632894661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:41:58,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:41:58,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:41:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460651167] [2024-10-12 19:41:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:41:58,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:41:58,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:41:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:41:58,901 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-12 19:41:59,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:59,145 INFO L93 Difference]: Finished difference Result 467 states and 650 transitions. [2024-10-12 19:41:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:41:59,145 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-12 19:41:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:59,147 INFO L225 Difference]: With dead ends: 467 [2024-10-12 19:41:59,148 INFO L226 Difference]: Without dead ends: 252 [2024-10-12 19:41:59,149 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-12 19:41:59,150 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 131 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:59,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 195 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:41:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-12 19:41:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2024-10-12 19:41:59,175 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-12 19:41:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 342 transitions. [2024-10-12 19:41:59,177 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 342 transitions. Word has length 32 [2024-10-12 19:41:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:59,178 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 342 transitions. [2024-10-12 19:41:59,178 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-12 19:41:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 342 transitions. [2024-10-12 19:41:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:41:59,183 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:59,183 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-12 19:41:59,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:41:59,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:41:59,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:41:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2081470064, now seen corresponding path program 1 times [2024-10-12 19:41:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:41:59,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688271195] [2024-10-12 19:41:59,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:41:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:59,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-12 19:41:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:41:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:41:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:41:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:59,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:41:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:59,288 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-12 19:41:59,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:41:59,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688271195] [2024-10-12 19:41:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688271195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:41:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474955610] [2024-10-12 19:41:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:41:59,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:41:59,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:41:59,291 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-12 19:41:59,292 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-12 19:41:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:41:59,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:41:59,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:41:59,417 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-12 19:41:59,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:41:59,485 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-12 19:41:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474955610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:41:59,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:41:59,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 8 [2024-10-12 19:41:59,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462209534] [2024-10-12 19:41:59,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:41:59,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:41:59,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:41:59,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:41:59,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:41:59,488 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-12 19:41:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:41:59,864 INFO L93 Difference]: Finished difference Result 636 states and 904 transitions. [2024-10-12 19:41:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-12 19:41:59,866 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-12 19:41:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:41:59,869 INFO L225 Difference]: With dead ends: 636 [2024-10-12 19:41:59,869 INFO L226 Difference]: Without dead ends: 388 [2024-10-12 19:41:59,870 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-12 19:41:59,874 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 161 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:41:59,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 234 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:41:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-12 19:41:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 357. [2024-10-12 19:41:59,928 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-12 19:41:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 491 transitions. [2024-10-12 19:41:59,930 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 491 transitions. Word has length 59 [2024-10-12 19:41:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:41:59,930 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 491 transitions. [2024-10-12 19:41:59,930 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-12 19:41:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 491 transitions. [2024-10-12 19:41:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 19:41:59,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:41:59,932 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-12 19:41:59,947 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-12 19:42:00,132 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-12 19:42:00,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:42:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:42:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash -781683712, now seen corresponding path program 2 times [2024-10-12 19:42:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:42:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770727842] [2024-10-12 19:42:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:42:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:42:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:42:00,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 19:42:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:42:00,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 19:42:00,173 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 19:42:00,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:42:00,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:42:00,177 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:42:00,220 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:42:00,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:42:00 BoogieIcfgContainer [2024-10-12 19:42:00,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:42:00,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:42:00,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:42:00,222 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:42:00,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:41:56" (3/4) ... [2024-10-12 19:42:00,223 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 19:42:00,273 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:42:00,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:42:00,274 INFO L158 Benchmark]: Toolchain (without parser) took 4406.76ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 95.5MB in the beginning and 195.7MB in the end (delta: -100.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:42:00,274 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:42:00,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.98ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 95.4MB in the beginning and 218.1MB in the end (delta: -122.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-10-12 19:42:00,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.02ms. Allocated memory is still 260.0MB. Free memory was 218.1MB in the beginning and 216.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:00,275 INFO L158 Benchmark]: Boogie Preprocessor took 50.64ms. Allocated memory is still 260.0MB. Free memory was 216.0MB in the beginning and 212.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:00,275 INFO L158 Benchmark]: RCFGBuilder took 375.60ms. Allocated memory is still 260.0MB. Free memory was 212.9MB in the beginning and 189.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-12 19:42:00,275 INFO L158 Benchmark]: TraceAbstraction took 3397.70ms. Allocated memory is still 260.0MB. Free memory was 188.7MB in the beginning and 202.0MB in the end (delta: -13.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:42:00,276 INFO L158 Benchmark]: Witness Printer took 51.51ms. Allocated memory is still 260.0MB. Free memory was 202.0MB in the beginning and 195.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 19:42:00,277 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.98ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 95.4MB in the beginning and 218.1MB in the end (delta: -122.7MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.02ms. Allocated memory is still 260.0MB. Free memory was 218.1MB in the beginning and 216.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.64ms. Allocated memory is still 260.0MB. Free memory was 216.0MB in the beginning and 212.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 375.60ms. Allocated memory is still 260.0MB. Free memory was 212.9MB in the beginning and 189.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3397.70ms. Allocated memory is still 260.0MB. Free memory was 188.7MB in the beginning and 202.0MB in the end (delta: -13.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 51.51ms. Allocated memory is still 260.0MB. Free memory was 202.0MB in the beginning and 195.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49] - GenericResultAtLocation [Line: 153]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [153] - GenericResultAtLocation [Line: 252]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [252] - GenericResultAtLocation [Line: 261]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [261] - GenericResultAtLocation [Line: 288]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [288] - GenericResultAtLocation [Line: 356]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [356] - GenericResultAtLocation [Line: 544]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [544] - GenericResultAtLocation [Line: 910]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [910] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 257]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L50] int cleanupTimeShifts = 4; [L159] int waterLevel = 1; [L160] int methaneLevelCritical = 0; [L359] int pumpRunning = 0; [L360] int systemActive = 1; [L714] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L131] int retValue_acc ; [L132] int tmp ; [L136] FCALL select_helpers() [L137] FCALL select_features() [L138] CALL, EXPR valid_product() [L937] int retValue_acc ; [L940] retValue_acc = 1 [L941] return (retValue_acc); [L138] RET, EXPR valid_product() [L138] tmp = valid_product() [L140] COND TRUE \read(tmp) [L142] FCALL setup() [L143] CALL runTest() [L122] CALL test() [L291] int splverifierCounter ; [L292] int tmp ; [L293] int tmp___0 ; [L294] int tmp___1 ; [L295] int tmp___2 ; [L298] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L300] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L302] COND TRUE splverifierCounter < 4 [L308] tmp = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L312] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L177] COND TRUE waterLevel < 2 [L178] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L312] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L318] tmp___0 = __VERIFIER_nondet_int() [L320] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L328] tmp___2 = __VERIFIER_nondet_int() [L330] COND TRUE \read(tmp___2) [L332] CALL startSystem() [L540] systemActive = 1 [L332] RET startSystem() [L345] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L366] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L373] COND TRUE \read(systemActive) [L375] CALL processEnvironment() [L421] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L424] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L439] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L395] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L398] COND TRUE ! pumpRunning [L400] CALL, EXPR isHighWaterLevel() [L518] int retValue_acc ; [L519] int tmp ; [L520] int tmp___0 ; [L524] CALL, EXPR isHighWaterSensorDry() [L239] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L242] COND FALSE !(waterLevel < 2) [L246] retValue_acc = 0 [L247] 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] [L524] RET, EXPR isHighWaterSensorDry() [L524] tmp = isHighWaterSensorDry() [L526] COND FALSE !(\read(tmp)) [L529] 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] [L531] retValue_acc = tmp___0 [L532] return (retValue_acc); [L400] RET, EXPR isHighWaterLevel() [L400] tmp = isHighWaterLevel() [L402] COND TRUE \read(tmp) [L404] CALL activatePump() [L449] pumpRunning = 1 [L404] RET activatePump() [L439] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L375] RET processEnvironment() [L381] CALL __utac_acc__Specification4_spec__1() [L264] int tmp ; [L265] int tmp___0 ; [L269] CALL, EXPR getWaterLevel() [L230] int retValue_acc ; [L233] retValue_acc = waterLevel [L234] return (retValue_acc); [L269] RET, EXPR getWaterLevel() [L269] tmp = getWaterLevel() [L271] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L381] RET __utac_acc__Specification4_spec__1() [L345] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L300] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L302] COND TRUE splverifierCounter < 4 [L308] tmp = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L318] tmp___0 = __VERIFIER_nondet_int() [L320] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L328] tmp___2 = __VERIFIER_nondet_int() [L330] COND TRUE \read(tmp___2) [L332] CALL startSystem() [L540] systemActive = 1 [L332] RET startSystem() [L345] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L366] COND TRUE \read(pumpRunning) [L368] CALL lowerWaterLevel() [L165] COND TRUE waterLevel > 0 [L166] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L368] RET lowerWaterLevel() [L373] COND TRUE \read(systemActive) [L375] CALL processEnvironment() [L421] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L424] COND TRUE \read(pumpRunning) [L426] CALL, EXPR isMethaneAlarm() [L462] int retValue_acc ; [L466] CALL, EXPR isMethaneLevelCritical() [L198] int retValue_acc ; [L201] retValue_acc = methaneLevelCritical [L202] return (retValue_acc); [L466] RET, EXPR isMethaneLevelCritical() [L466] retValue_acc = isMethaneLevelCritical() [L468] return (retValue_acc); [L426] RET, EXPR isMethaneAlarm() [L426] tmp = isMethaneAlarm() [L428] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L434] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L395] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L398] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L413] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L434] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L375] RET processEnvironment() [L381] CALL __utac_acc__Specification4_spec__1() [L264] int tmp ; [L265] int tmp___0 ; [L269] CALL, EXPR getWaterLevel() [L230] int retValue_acc ; [L233] retValue_acc = waterLevel [L234] return (retValue_acc); [L269] RET, EXPR getWaterLevel() [L269] tmp = getWaterLevel() [L271] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L381] RET __utac_acc__Specification4_spec__1() [L345] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L300] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L302] COND TRUE splverifierCounter < 4 [L308] tmp = __VERIFIER_nondet_int() [L310] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L318] tmp___0 = __VERIFIER_nondet_int() [L320] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L328] tmp___2 = __VERIFIER_nondet_int() [L330] COND TRUE \read(tmp___2) [L332] CALL startSystem() [L540] systemActive = 1 [L332] RET startSystem() [L345] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L366] COND TRUE \read(pumpRunning) [L368] CALL lowerWaterLevel() [L165] COND TRUE waterLevel > 0 [L166] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L368] RET lowerWaterLevel() [L373] COND TRUE \read(systemActive) [L375] CALL processEnvironment() [L421] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L424] COND TRUE \read(pumpRunning) [L426] CALL, EXPR isMethaneAlarm() [L462] int retValue_acc ; [L466] CALL, EXPR isMethaneLevelCritical() [L198] int retValue_acc ; [L201] retValue_acc = methaneLevelCritical [L202] return (retValue_acc); [L466] RET, EXPR isMethaneLevelCritical() [L466] retValue_acc = isMethaneLevelCritical() [L468] return (retValue_acc); [L426] RET, EXPR isMethaneAlarm() [L426] tmp = isMethaneAlarm() [L428] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L434] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L395] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L398] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L413] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L434] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L375] RET processEnvironment() [L381] CALL __utac_acc__Specification4_spec__1() [L264] int tmp ; [L265] int tmp___0 ; [L269] CALL, EXPR getWaterLevel() [L230] int retValue_acc ; [L233] retValue_acc = waterLevel [L234] return (retValue_acc); [L269] RET, EXPR getWaterLevel() [L269] tmp = getWaterLevel() [L271] COND TRUE tmp == 0 [L273] CALL, EXPR isPumpRunning() [L473] int retValue_acc ; [L476] retValue_acc = pumpRunning [L477] return (retValue_acc); [L273] RET, EXPR isPumpRunning() [L273] tmp___0 = isPumpRunning() [L275] COND TRUE \read(tmp___0) [L277] CALL __automaton_fail() [L257] 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: 3.3s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 731 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 713 mSDsluCounter, 1346 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 798 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1240 IncrementalHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 548 mSDtfsCounter, 1240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 162 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=10, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 732 SizeOfPredicates, 2 NumberOfNonLiveVariables, 232 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-12 19:42:00,301 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