./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product44.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 471ad46a1662a2ee36763023473e29e175f1086d40bbf36d792af661871bf09e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:08:14,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:08:14,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:08:14,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:08:14,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:08:14,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:08:14,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:08:14,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:08:14,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:08:14,581 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:08:14,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:08:14,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:08:14,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:08:14,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:08:14,583 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:08:14,584 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:08:14,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:08:14,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:08:14,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:08:14,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:08:14,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:08:14,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:08:14,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:08:14,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:08:14,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:08:14,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:08:14,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:08:14,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:08:14,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:08:14,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:08:14,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:08:14,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:08:14,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:08:14,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:08:14,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:08:14,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:08:14,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:08:14,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:08:14,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:08:14,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:08:14,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:08:14,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:08:14,592 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 -> 471ad46a1662a2ee36763023473e29e175f1086d40bbf36d792af661871bf09e [2024-10-14 03:08:14,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:08:14,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:08:14,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:08:14,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:08:14,913 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:08:14,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c [2024-10-14 03:08:16,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:08:16,600 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:08:16,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c [2024-10-14 03:08:16,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d5aa1e74/55f7f60f39cd4ee6bddb00e81a75e252/FLAGa30b4655d [2024-10-14 03:08:16,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d5aa1e74/55f7f60f39cd4ee6bddb00e81a75e252 [2024-10-14 03:08:16,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:08:16,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:08:16,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:08:16,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:08:16,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:08:16,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:08:16" (1/1) ... [2024-10-14 03:08:16,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42544559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:16, skipping insertion in model container [2024-10-14 03:08:16,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:08:16" (1/1) ... [2024-10-14 03:08:17,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:08:17,179 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c[1605,1618] [2024-10-14 03:08:17,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:08:17,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:08:17,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] [2024-10-14 03:08:17,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [58] [2024-10-14 03:08:17,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [133] [2024-10-14 03:08:17,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [335] [2024-10-14 03:08:17,352 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [373] [2024-10-14 03:08:17,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [471] [2024-10-14 03:08:17,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [510] [2024-10-14 03:08:17,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [605] [2024-10-14 03:08:17,359 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product44.cil.c[1605,1618] [2024-10-14 03:08:17,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:08:17,441 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:08:17,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17 WrapperNode [2024-10-14 03:08:17,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:08:17,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:08:17,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:08:17,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:08:17,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,504 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 199 [2024-10-14 03:08:17,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:08:17,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:08:17,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:08:17,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:08:17,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,542 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:08:17,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:08:17,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:08:17,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:08:17,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:08:17,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (1/1) ... [2024-10-14 03:08:17,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:08:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:08:17,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:08:17,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:08:17,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:08:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-10-14 03:08:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-10-14 03:08:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-10-14 03:08:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-10-14 03:08:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 03:08:17,654 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 03:08:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 03:08:17,655 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 03:08:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-10-14 03:08:17,655 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-10-14 03:08:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:08:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-10-14 03:08:17,656 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-10-14 03:08:17,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:08:17,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:08:17,766 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:08:17,770 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:08:18,091 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-10-14 03:08:18,092 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:08:18,171 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:08:18,171 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:08:18,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:18 BoogieIcfgContainer [2024-10-14 03:08:18,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:08:18,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:08:18,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:08:18,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:08:18,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:08:16" (1/3) ... [2024-10-14 03:08:18,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638e1c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:08:18, skipping insertion in model container [2024-10-14 03:08:18,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:08:17" (2/3) ... [2024-10-14 03:08:18,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@638e1c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:08:18, skipping insertion in model container [2024-10-14 03:08:18,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:18" (3/3) ... [2024-10-14 03:08:18,181 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product44.cil.c [2024-10-14 03:08:18,206 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:08:18,206 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:08:18,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:08:18,270 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;@6be22257, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:08:18,270 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:08:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 47 states have (on average 1.553191489361702) internal successors, (73), 53 states have internal predecessors, (73), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 03:08:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 03:08:18,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:18,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:18,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:18,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:18,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1714865509, now seen corresponding path program 1 times [2024-10-14 03:08:18,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:18,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274503984] [2024-10-14 03:08:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:18,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 03:08:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:18,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:18,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274503984] [2024-10-14 03:08:18,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274503984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:18,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:18,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:08:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778254441] [2024-10-14 03:08:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:18,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:08:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:08:18,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:08:18,509 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.553191489361702) internal successors, (73), 53 states have internal predecessors, (73), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:18,581 INFO L93 Difference]: Finished difference Result 128 states and 187 transitions. [2024-10-14 03:08:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:08:18,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-14 03:08:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:18,596 INFO L225 Difference]: With dead ends: 128 [2024-10-14 03:08:18,597 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 03:08:18,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:08:18,603 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:18,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 03:08:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 03:08:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 49 states have internal predecessors, (63), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 03:08:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2024-10-14 03:08:18,656 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 17 [2024-10-14 03:08:18,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:18,658 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2024-10-14 03:08:18,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:18,659 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2024-10-14 03:08:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 03:08:18,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:18,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:18,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:08:18,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:18,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:18,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1559814055, now seen corresponding path program 1 times [2024-10-14 03:08:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881144388] [2024-10-14 03:08:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:18,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:18,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 03:08:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881144388] [2024-10-14 03:08:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881144388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22896020] [2024-10-14 03:08:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:18,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:18,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:18,818 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:18,860 INFO L93 Difference]: Finished difference Result 91 states and 124 transitions. [2024-10-14 03:08:18,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:18,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-14 03:08:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:18,866 INFO L225 Difference]: With dead ends: 91 [2024-10-14 03:08:18,866 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 03:08:18,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:18,870 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 104 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-14 03:08:18,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 104 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:18,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 03:08:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 03:08:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 44 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-14 03:08:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-14 03:08:18,880 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 18 [2024-10-14 03:08:18,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:18,880 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-14 03:08:18,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-14 03:08:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 03:08:18,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:18,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:18,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:08:18,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:18,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:18,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2041251849, now seen corresponding path program 1 times [2024-10-14 03:08:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:18,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900530554] [2024-10-14 03:08:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:18,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:08:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:19,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:19,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900530554] [2024-10-14 03:08:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900530554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:19,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:19,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802744159] [2024-10-14 03:08:19,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:19,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:19,009 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:19,088 INFO L93 Difference]: Finished difference Result 152 states and 210 transitions. [2024-10-14 03:08:19,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:19,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-14 03:08:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:19,090 INFO L225 Difference]: With dead ends: 152 [2024-10-14 03:08:19,092 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 03:08:19,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:19,094 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 65 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:19,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 126 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 03:08:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2024-10-14 03:08:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 82 states have internal predecessors, (107), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 03:08:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-10-14 03:08:19,115 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 21 [2024-10-14 03:08:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:19,115 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-10-14 03:08:19,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-10-14 03:08:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 03:08:19,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:19,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:19,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:08:19,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:19,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:19,119 INFO L85 PathProgramCache]: Analyzing trace with hash 217042691, now seen corresponding path program 1 times [2024-10-14 03:08:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:19,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637588385] [2024-10-14 03:08:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:08:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:08:19,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:19,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637588385] [2024-10-14 03:08:19,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637588385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:19,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:19,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545618887] [2024-10-14 03:08:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:19,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:19,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:19,275 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:19,377 INFO L93 Difference]: Finished difference Result 261 states and 363 transitions. [2024-10-14 03:08:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:08:19,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-10-14 03:08:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:19,379 INFO L225 Difference]: With dead ends: 261 [2024-10-14 03:08:19,379 INFO L226 Difference]: Without dead ends: 165 [2024-10-14 03:08:19,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:08:19,382 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:19,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-14 03:08:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2024-10-14 03:08:19,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.401639344262295) internal successors, (171), 135 states have internal predecessors, (171), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2024-10-14 03:08:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2024-10-14 03:08:19,407 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 24 [2024-10-14 03:08:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:19,409 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2024-10-14 03:08:19,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:08:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2024-10-14 03:08:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:08:19,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:19,414 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:08:19,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:08:19,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash 381801612, now seen corresponding path program 1 times [2024-10-14 03:08:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:19,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415018324] [2024-10-14 03:08:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:08:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:08:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:08:19,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:19,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415018324] [2024-10-14 03:08:19,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415018324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:19,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:19,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:19,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333163883] [2024-10-14 03:08:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:19,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:19,502 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:19,571 INFO L93 Difference]: Finished difference Result 332 states and 450 transitions. [2024-10-14 03:08:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:08:19,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-14 03:08:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:19,574 INFO L225 Difference]: With dead ends: 332 [2024-10-14 03:08:19,574 INFO L226 Difference]: Without dead ends: 169 [2024-10-14 03:08:19,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:19,576 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:19,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-14 03:08:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-10-14 03:08:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 126 states have (on average 1.3888888888888888) internal successors, (175), 139 states have internal predecessors, (175), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2024-10-14 03:08:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2024-10-14 03:08:19,597 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 34 [2024-10-14 03:08:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:19,598 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2024-10-14 03:08:19,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2024-10-14 03:08:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:08:19,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:19,600 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:08:19,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:08:19,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:19,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1307142130, now seen corresponding path program 1 times [2024-10-14 03:08:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355914764] [2024-10-14 03:08:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:19,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:08:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:08:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:08:19,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:19,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355914764] [2024-10-14 03:08:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355914764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:19,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:19,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:19,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223541463] [2024-10-14 03:08:19,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:19,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:19,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:19,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:19,710 INFO L87 Difference]: Start difference. First operand 169 states and 223 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:19,755 INFO L93 Difference]: Finished difference Result 340 states and 458 transitions. [2024-10-14 03:08:19,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:08:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-14 03:08:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:19,758 INFO L225 Difference]: With dead ends: 340 [2024-10-14 03:08:19,759 INFO L226 Difference]: Without dead ends: 173 [2024-10-14 03:08:19,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:19,761 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:19,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-14 03:08:19,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-14 03:08:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 130 states have (on average 1.376923076923077) internal successors, (179), 143 states have internal predecessors, (179), 22 states have call successors, (22), 20 states have call predecessors, (22), 20 states have return successors, (26), 22 states have call predecessors, (26), 22 states have call successors, (26) [2024-10-14 03:08:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 227 transitions. [2024-10-14 03:08:19,792 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 227 transitions. Word has length 34 [2024-10-14 03:08:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:19,793 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 227 transitions. [2024-10-14 03:08:19,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 227 transitions. [2024-10-14 03:08:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:08:19,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:19,797 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:08:19,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:08:19,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:19,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash -884440304, now seen corresponding path program 1 times [2024-10-14 03:08:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:19,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172294172] [2024-10-14 03:08:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:19,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 03:08:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:08:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:08:19,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:19,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172294172] [2024-10-14 03:08:19,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172294172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:19,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:19,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:08:19,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085952919] [2024-10-14 03:08:19,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:19,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:19,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:19,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:19,879 INFO L87 Difference]: Start difference. First operand 173 states and 227 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:19,931 INFO L93 Difference]: Finished difference Result 418 states and 551 transitions. [2024-10-14 03:08:19,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:19,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-10-14 03:08:19,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:19,937 INFO L225 Difference]: With dead ends: 418 [2024-10-14 03:08:19,937 INFO L226 Difference]: Without dead ends: 247 [2024-10-14 03:08:19,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:08:19,939 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 33 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:19,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 110 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-14 03:08:19,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-14 03:08:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 186 states have (on average 1.3333333333333333) internal successors, (248), 201 states have internal predecessors, (248), 32 states have call successors, (32), 30 states have call predecessors, (32), 28 states have return successors, (36), 30 states have call predecessors, (36), 32 states have call successors, (36) [2024-10-14 03:08:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 316 transitions. [2024-10-14 03:08:19,967 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 316 transitions. Word has length 34 [2024-10-14 03:08:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:19,968 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 316 transitions. [2024-10-14 03:08:19,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:08:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 316 transitions. [2024-10-14 03:08:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 03:08:19,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:19,970 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:19,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:08:19,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:19,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:19,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1338306570, now seen corresponding path program 1 times [2024-10-14 03:08:19,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:19,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844120196] [2024-10-14 03:08:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:19,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 03:08:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:08:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:08:20,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:20,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844120196] [2024-10-14 03:08:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844120196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:20,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:08:20,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:08:20,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161746882] [2024-10-14 03:08:20,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:20,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:08:20,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:20,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:08:20,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:08:20,073 INFO L87 Difference]: Start difference. First operand 247 states and 316 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:08:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:20,258 INFO L93 Difference]: Finished difference Result 533 states and 714 transitions. [2024-10-14 03:08:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:08:20,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-10-14 03:08:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:20,264 INFO L225 Difference]: With dead ends: 533 [2024-10-14 03:08:20,265 INFO L226 Difference]: Without dead ends: 531 [2024-10-14 03:08:20,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:08:20,268 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 114 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:20,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 134 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-14 03:08:20,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 509. [2024-10-14 03:08:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 389 states have (on average 1.3316195372750643) internal successors, (518), 432 states have internal predecessors, (518), 69 states have call successors, (69), 45 states have call predecessors, (69), 50 states have return successors, (97), 62 states have call predecessors, (97), 69 states have call successors, (97) [2024-10-14 03:08:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 684 transitions. [2024-10-14 03:08:20,317 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 684 transitions. Word has length 38 [2024-10-14 03:08:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:20,317 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 684 transitions. [2024-10-14 03:08:20,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 03:08:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 684 transitions. [2024-10-14 03:08:20,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:08:20,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:20,321 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:20,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:08:20,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:20,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1305944733, now seen corresponding path program 1 times [2024-10-14 03:08:20,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:20,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582844928] [2024-10-14 03:08:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:20,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:08:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:08:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:08:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:08:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 03:08:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:08:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:20,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582844928] [2024-10-14 03:08:20,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582844928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:08:20,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492292588] [2024-10-14 03:08:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:20,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:08:20,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:08:20,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:08:20,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:08:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:20,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 03:08:20,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:08:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 03:08:20,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:08:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-14 03:08:20,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492292588] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 03:08:20,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:08:20,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 5] total 13 [2024-10-14 03:08:20,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79114140] [2024-10-14 03:08:20,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:20,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:08:20,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:20,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:08:20,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:08:20,958 INFO L87 Difference]: Start difference. First operand 509 states and 684 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 03:08:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:21,121 INFO L93 Difference]: Finished difference Result 1469 states and 2015 transitions. [2024-10-14 03:08:21,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:08:21,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2024-10-14 03:08:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:21,129 INFO L225 Difference]: With dead ends: 1469 [2024-10-14 03:08:21,129 INFO L226 Difference]: Without dead ends: 962 [2024-10-14 03:08:21,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:08:21,132 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 41 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:21,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 266 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-10-14 03:08:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 818. [2024-10-14 03:08:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 620 states have (on average 1.3) internal successors, (806), 689 states have internal predecessors, (806), 111 states have call successors, (111), 75 states have call predecessors, (111), 86 states have return successors, (157), 102 states have call predecessors, (157), 111 states have call successors, (157) [2024-10-14 03:08:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1074 transitions. [2024-10-14 03:08:21,201 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1074 transitions. Word has length 65 [2024-10-14 03:08:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:21,201 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1074 transitions. [2024-10-14 03:08:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-14 03:08:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1074 transitions. [2024-10-14 03:08:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:08:21,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:21,205 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:21,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:08:21,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:08:21,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:21,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1438851367, now seen corresponding path program 1 times [2024-10-14 03:08:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:21,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337962367] [2024-10-14 03:08:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 03:08:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:08:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:08:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:08:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:08:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:08:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:08:21,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:21,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337962367] [2024-10-14 03:08:21,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337962367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:08:21,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230509562] [2024-10-14 03:08:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:21,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:08:21,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:08:21,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:08:21,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:08:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:21,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 03:08:21,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:08:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:08:21,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:08:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230509562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:21,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:08:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-10-14 03:08:21,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089596545] [2024-10-14 03:08:21,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:21,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:08:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:21,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:08:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:08:21,802 INFO L87 Difference]: Start difference. First operand 818 states and 1074 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 03:08:21,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:21,968 INFO L93 Difference]: Finished difference Result 1622 states and 2152 transitions. [2024-10-14 03:08:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:08:21,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2024-10-14 03:08:21,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:21,974 INFO L225 Difference]: With dead ends: 1622 [2024-10-14 03:08:21,974 INFO L226 Difference]: Without dead ends: 806 [2024-10-14 03:08:21,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:08:21,977 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 48 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:21,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 432 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:08:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-14 03:08:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 674. [2024-10-14 03:08:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 511 states have (on average 1.2857142857142858) internal successors, (657), 556 states have internal predecessors, (657), 88 states have call successors, (88), 68 states have call predecessors, (88), 74 states have return successors, (112), 84 states have call predecessors, (112), 88 states have call successors, (112) [2024-10-14 03:08:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 857 transitions. [2024-10-14 03:08:22,035 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 857 transitions. Word has length 69 [2024-10-14 03:08:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:22,036 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 857 transitions. [2024-10-14 03:08:22,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 03:08:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 857 transitions. [2024-10-14 03:08:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 03:08:22,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:22,039 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:22,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:08:22,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 03:08:22,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:22,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:22,240 INFO L85 PathProgramCache]: Analyzing trace with hash 366981014, now seen corresponding path program 1 times [2024-10-14 03:08:22,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:22,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142660846] [2024-10-14 03:08:22,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:22,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:08:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:08:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 03:08:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 03:08:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:08:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:08:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 03:08:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 03:08:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:08:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142660846] [2024-10-14 03:08:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142660846] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:08:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056567318] [2024-10-14 03:08:22,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:22,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:08:22,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:08:22,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:08:22,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:08:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:08:22,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:08:22,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:08:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-14 03:08:22,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:08:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056567318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:08:22,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:08:22,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2024-10-14 03:08:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828548159] [2024-10-14 03:08:22,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:08:22,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:08:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:08:22,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:08:22,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:08:22,434 INFO L87 Difference]: Start difference. First operand 674 states and 857 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 03:08:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:08:22,511 INFO L93 Difference]: Finished difference Result 1134 states and 1435 transitions. [2024-10-14 03:08:22,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:08:22,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 89 [2024-10-14 03:08:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:08:22,515 INFO L225 Difference]: With dead ends: 1134 [2024-10-14 03:08:22,515 INFO L226 Difference]: Without dead ends: 462 [2024-10-14 03:08:22,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:08:22,518 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:08:22,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 136 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:08:22,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-14 03:08:22,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 454. [2024-10-14 03:08:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 340 states have (on average 1.261764705882353) internal successors, (429), 371 states have internal predecessors, (429), 60 states have call successors, (60), 50 states have call predecessors, (60), 53 states have return successors, (74), 56 states have call predecessors, (74), 60 states have call successors, (74) [2024-10-14 03:08:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 563 transitions. [2024-10-14 03:08:22,565 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 563 transitions. Word has length 89 [2024-10-14 03:08:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:08:22,565 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 563 transitions. [2024-10-14 03:08:22,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-14 03:08:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 563 transitions. [2024-10-14 03:08:22,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:08:22,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:08:22,568 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:22,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 03:08:22,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:08:22,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:08:22,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:08:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash 758955164, now seen corresponding path program 1 times [2024-10-14 03:08:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:08:22,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485446054] [2024-10-14 03:08:22,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:08:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:08:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:08:22,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 03:08:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 03:08:22,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 03:08:22,854 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 03:08:22,855 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:08:22,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:08:22,860 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:08:22,945 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 03:08:22,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 03:08:22 BoogieIcfgContainer [2024-10-14 03:08:22,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 03:08:22,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 03:08:22,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 03:08:22,950 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 03:08:22,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:08:18" (3/4) ... [2024-10-14 03:08:22,952 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 03:08:23,036 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 03:08:23,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 03:08:23,040 INFO L158 Benchmark]: Toolchain (without parser) took 6083.72ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 131.4MB in the beginning and 167.4MB in the end (delta: -36.0MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-10-14 03:08:23,040 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 03:08:23,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.88ms. Allocated memory is still 165.7MB. Free memory was 131.0MB in the beginning and 110.4MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 03:08:23,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.89ms. Allocated memory is still 165.7MB. Free memory was 110.4MB in the beginning and 108.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:08:23,041 INFO L158 Benchmark]: Boogie Preprocessor took 47.75ms. Allocated memory is still 165.7MB. Free memory was 108.5MB in the beginning and 105.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 03:08:23,041 INFO L158 Benchmark]: RCFGBuilder took 614.92ms. Allocated memory is still 165.7MB. Free memory was 105.8MB in the beginning and 119.0MB in the end (delta: -13.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 03:08:23,041 INFO L158 Benchmark]: TraceAbstraction took 4773.91ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 118.0MB in the beginning and 174.8MB in the end (delta: -56.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-10-14 03:08:23,041 INFO L158 Benchmark]: Witness Printer took 89.07ms. Allocated memory is still 245.4MB. Free memory was 174.8MB in the beginning and 167.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 03:08:23,043 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.19ms. Allocated memory is still 165.7MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.88ms. Allocated memory is still 165.7MB. Free memory was 131.0MB in the beginning and 110.4MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.89ms. Allocated memory is still 165.7MB. Free memory was 110.4MB in the beginning and 108.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.75ms. Allocated memory is still 165.7MB. Free memory was 108.5MB in the beginning and 105.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 614.92ms. Allocated memory is still 165.7MB. Free memory was 105.8MB in the beginning and 119.0MB in the end (delta: -13.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4773.91ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 118.0MB in the beginning and 174.8MB in the end (delta: -56.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * Witness Printer took 89.07ms. Allocated memory is still 245.4MB. Free memory was 174.8MB in the beginning and 167.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [49] - GenericResultAtLocation [Line: 58]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [58] - GenericResultAtLocation [Line: 133]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [133] - GenericResultAtLocation [Line: 335]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [335] - GenericResultAtLocation [Line: 373]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [373] - GenericResultAtLocation [Line: 471]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [471] - GenericResultAtLocation [Line: 510]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [510] - GenericResultAtLocation [Line: 605]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [605] * 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: 54]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L142] int pumpRunning = 0; [L143] int systemActive = 1; [L374] int cleanupTimeShifts = 4; [L472] int methAndRunningLastTime ; [L512] int waterLevel = 1; [L513] int methaneLevelCritical = 0; [L775] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L449] int retValue_acc ; [L450] int tmp ; [L454] FCALL select_helpers() [L455] FCALL select_features() [L456] CALL, EXPR valid_product() [L365] int retValue_acc ; [L368] retValue_acc = 1 [L369] return (retValue_acc); [L456] RET, EXPR valid_product() [L456] tmp = valid_product() [L458] COND TRUE \read(tmp) [L460] FCALL setup() [L461] CALL runTest() [L442] CALL __utac_acc__Specification2_spec__1() [L477] methAndRunningLastTime = 0 [L442] RET __utac_acc__Specification2_spec__1() [L443] CALL test() [L66] int splverifierCounter ; [L67] int tmp ; [L68] int tmp___0 ; [L69] int tmp___1 ; [L70] int tmp___2 ; [L73] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L75] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L77] COND TRUE splverifierCounter < 4 [L83] tmp = __VERIFIER_nondet_int() [L85] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L87] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L530] COND TRUE waterLevel < 2 [L531] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L87] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L93] tmp___0 = __VERIFIER_nondet_int() [L95] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L103] tmp___2 = __VERIFIER_nondet_int() [L105] COND TRUE \read(tmp___2) [L107] CALL startSystem() [L331] systemActive = 1 [L107] RET startSystem() [L122] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L150] COND FALSE !(\read(pumpRunning)) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L157] COND TRUE \read(systemActive) [L159] CALL processEnvironment() [L179] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L182] COND TRUE ! pumpRunning [L184] CALL, EXPR isHighWaterLevel() [L294] int retValue_acc ; [L295] int tmp ; [L296] int tmp___0 ; [L300] CALL, EXPR isHighWaterSensorDry() [L592] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L595] COND FALSE !(waterLevel < 2) [L599] retValue_acc = 0 [L600] return (retValue_acc); VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L300] RET, EXPR isHighWaterSensorDry() [L300] tmp = isHighWaterSensorDry() [L302] COND FALSE !(\read(tmp)) [L305] tmp___0 = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L307] retValue_acc = tmp___0 [L308] return (retValue_acc); [L184] RET, EXPR isHighWaterLevel() [L184] tmp = isHighWaterLevel() [L186] COND TRUE \read(tmp) [L188] CALL activatePump() [L213] int tmp ; [L217] CALL, EXPR isMethaneAlarm() [L238] int retValue_acc ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L242] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L551] int retValue_acc ; [L554] retValue_acc = methaneLevelCritical [L555] return (retValue_acc); [L242] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L242] retValue_acc = isMethaneLevelCritical() [L244] return (retValue_acc); [L217] RET, EXPR isMethaneAlarm() [L217] tmp = isMethaneAlarm() [L219] COND FALSE !(\read(tmp)) [L223] CALL activatePump__wrappee__highWaterSensor() [L207] pumpRunning = 1 [L223] RET activatePump__wrappee__highWaterSensor() [L188] RET activatePump() [L159] RET processEnvironment() [L165] CALL __utac_acc__Specification2_spec__2() [L482] int tmp ; [L483] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L487] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L551] int retValue_acc ; [L554] retValue_acc = methaneLevelCritical [L555] return (retValue_acc); [L487] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L487] tmp = isMethaneLevelCritical() [L489] COND FALSE !(\read(tmp)) [L505] methAndRunningLastTime = 0 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L165] RET __utac_acc__Specification2_spec__2() [L122] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L75] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L77] COND TRUE splverifierCounter < 4 [L83] tmp = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L93] tmp___0 = __VERIFIER_nondet_int() [L95] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L97] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L542] COND FALSE !(\read(methaneLevelCritical)) [L545] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L97] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L103] tmp___2 = __VERIFIER_nondet_int() [L105] COND TRUE \read(tmp___2) [L107] CALL startSystem() [L331] systemActive = 1 [L107] RET startSystem() [L122] CALL timeShift() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L150] COND TRUE \read(pumpRunning) [L152] CALL lowerWaterLevel() [L518] COND TRUE waterLevel > 0 [L519] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L152] RET lowerWaterLevel() [L157] COND TRUE \read(systemActive) [L159] CALL processEnvironment() [L179] int tmp ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L182] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L197] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L159] RET processEnvironment() [L165] CALL __utac_acc__Specification2_spec__2() [L482] int tmp ; [L483] int tmp___0 ; VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L487] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L551] int retValue_acc ; [L554] retValue_acc = methaneLevelCritical [L555] return (retValue_acc); [L487] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L487] tmp = isMethaneLevelCritical() [L489] COND TRUE \read(tmp) [L491] CALL, EXPR isPumpRunning() [L249] int retValue_acc ; [L252] retValue_acc = pumpRunning [L253] return (retValue_acc); [L491] RET, EXPR isPumpRunning() [L491] tmp___0 = isPumpRunning() [L493] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=0, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L494] COND FALSE !(\read(methAndRunningLastTime)) [L499] methAndRunningLastTime = 1 VAL [\old(methAndRunningLastTime)=0, \old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L165] RET __utac_acc__Specification2_spec__2() [L122] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L75] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L77] COND TRUE splverifierCounter < 4 [L83] tmp = __VERIFIER_nondet_int() [L85] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L93] tmp___0 = __VERIFIER_nondet_int() [L95] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L103] tmp___2 = __VERIFIER_nondet_int() [L105] COND TRUE \read(tmp___2) [L107] CALL startSystem() [L331] systemActive = 1 [L107] RET startSystem() [L122] CALL timeShift() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L150] COND TRUE \read(pumpRunning) [L152] CALL lowerWaterLevel() [L518] COND TRUE waterLevel > 0 [L519] waterLevel = waterLevel - 1 VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L152] RET lowerWaterLevel() [L157] COND TRUE \read(systemActive) [L159] CALL processEnvironment() [L179] int tmp ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L182] COND FALSE !(! pumpRunning) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L197] FCALL processEnvironment__wrappee__base() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L159] RET processEnvironment() [L165] CALL __utac_acc__Specification2_spec__2() [L482] int tmp ; [L483] int tmp___0 ; VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L487] CALL, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L551] int retValue_acc ; [L554] retValue_acc = methaneLevelCritical [L555] return (retValue_acc); [L487] RET, EXPR isMethaneLevelCritical() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L487] tmp = isMethaneLevelCritical() [L489] COND TRUE \read(tmp) [L491] CALL, EXPR isPumpRunning() [L249] int retValue_acc ; [L252] retValue_acc = pumpRunning [L253] return (retValue_acc); [L491] RET, EXPR isPumpRunning() [L491] tmp___0 = isPumpRunning() [L493] COND TRUE \read(tmp___0) VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] [L494] COND TRUE \read(methAndRunningLastTime) [L496] CALL __automaton_fail() [L54] reach_error() VAL [\old(methAndRunningLastTime)=1, \old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methAndRunningLastTime=1, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 401 mSDsluCounter, 1865 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1142 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 572 IncrementalHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 723 mSDtfsCounter, 572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 400 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=818occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 310 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 760 NumberOfCodeBlocks, 760 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 716 ConstructedInterpolants, 0 QuantifiedInterpolants, 1267 SizeOfPredicates, 1 NumberOfNonLiveVariables, 853 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 243/254 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-14 03:08:23,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE