./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:58:49,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:58:49,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:58:49,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:58:49,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:58:49,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:58:49,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:58:49,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:58:49,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:58:49,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:58:49,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:58:49,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:58:49,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:58:49,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:58:49,412 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:58:49,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:58:49,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:58:49,413 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:58:49,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:58:49,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:58:49,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:58:49,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:58:49,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:58:49,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:58:49,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:58:49,418 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:58:49,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:58:49,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:58:49,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:58:49,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:58:49,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:58:49,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:58:49,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:58:49,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:58:49,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:58:49,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:58:49,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:58:49,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:58:49,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:58:49,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:58:49,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:58:49,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:58:49,427 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-clean/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-clean/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 -> c1d6cba599289c2637bd3d8da41e464d318a32e6ae6e6e0e391ff437e6ce1fcc [2024-10-11 03:58:49,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:58:49,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:58:49,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:58:49,751 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:58:49,751 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:58:49,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2024-10-11 03:58:51,261 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:58:51,542 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:58:51,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stateful-2.i [2024-10-11 03:58:51,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cef63dbc9/c23ac379900345cfbe00338a6be8b7d8/FLAG0e2d5f26c [2024-10-11 03:58:51,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cef63dbc9/c23ac379900345cfbe00338a6be8b7d8 [2024-10-11 03:58:51,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:58:51,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:58:51,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:58:51,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:58:51,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:58:51,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:58:51" (1/1) ... [2024-10-11 03:58:51,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de9bb88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:51, skipping insertion in model container [2024-10-11 03:58:51,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:58:51" (1/1) ... [2024-10-11 03:58:51,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:58:52,221 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/seq-pthread/cs_stateful-2.i[23607,23620] [2024-10-11 03:58:52,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:58:52,367 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:58:52,410 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/seq-pthread/cs_stateful-2.i[23607,23620] [2024-10-11 03:58:52,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:58:52,514 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:58:52,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52 WrapperNode [2024-10-11 03:58:52,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:58:52,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:58:52,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:58:52,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:58:52,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,595 INFO L138 Inliner]: procedures = 145, calls = 245, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 546 [2024-10-11 03:58:52,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:58:52,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:58:52,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:58:52,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:58:52,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,662 INFO L175 MemorySlicer]: Split 114 memory accesses to 16 slices as follows [2, 8, 7, 8, 20, 12, 3, 10, 10, 3, 0, 12, 3, 7, 6, 3]. 18 percent of accesses are in the largest equivalence class. The 30 initializations are split as follows [2, 3, 0, 3, 6, 6, 0, 2, 2, 0, 0, 4, 0, 0, 2, 0]. The 35 writes are split as follows [0, 2, 1, 2, 8, 3, 1, 4, 4, 1, 0, 4, 1, 1, 2, 1]. [2024-10-11 03:58:52,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,756 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:58:52,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:58:52,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:58:52,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:58:52,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (1/1) ... [2024-10-11 03:58:52,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:58:52,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:58:52,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:58:52,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:58:52,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 03:58:52,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 03:58:52,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 03:58:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 03:58:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 03:58:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 03:58:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 03:58:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 03:58:52,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 03:58:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 03:58:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 03:58:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 03:58:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 03:58:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 03:58:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 03:58:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2024-10-11 03:58:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 03:58:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 03:58:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 03:58:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 03:58:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 03:58:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 03:58:52,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 03:58:52,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 03:58:52,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 03:58:52,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 03:58:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 03:58:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 03:58:52,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 03:58:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 03:58:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 03:58:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2024-10-11 03:58:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 03:58:52,922 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 03:58:52,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2024-10-11 03:58:52,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2024-10-11 03:58:52,924 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-10-11 03:58:52,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-10-11 03:58:52,925 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-10-11 03:58:52,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-10-11 03:58:52,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 03:58:52,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 03:58:52,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 03:58:52,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 03:58:52,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 03:58:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 03:58:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 03:58:52,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 03:58:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 03:58:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 03:58:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-10-11 03:58:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-10-11 03:58:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-10-11 03:58:52,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-10-11 03:58:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2024-10-11 03:58:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2024-10-11 03:58:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-10-11 03:58:52,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-10-11 03:58:52,930 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-11 03:58:52,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-10-11 03:58:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 03:58:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 03:58:52,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 03:58:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 03:58:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 03:58:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 03:58:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 03:58:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 03:58:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 03:58:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 03:58:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 03:58:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-10-11 03:58:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-10-11 03:58:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-10-11 03:58:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-10-11 03:58:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2024-10-11 03:58:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2024-10-11 03:58:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-10-11 03:58:52,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-10-11 03:58:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:58:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 03:58:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 03:58:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 03:58:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 03:58:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 03:58:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 03:58:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 03:58:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 03:58:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 03:58:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 03:58:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 03:58:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 03:58:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 03:58:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 03:58:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 03:58:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-10-11 03:58:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-10-11 03:58:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:58:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:58:53,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:58:53,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:58:53,677 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: SUMMARY for call __CS_cs(); srcloc: null [2024-10-11 03:58:53,677 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-10-11 03:58:53,677 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-11 03:58:53,678 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-11 03:58:53,678 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-10-11 03:58:53,678 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-10-11 03:58:53,678 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2024-10-11 03:58:54,091 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-10-11 03:58:54,092 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:58:54,142 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:58:54,143 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 03:58:54,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:58:54 BoogieIcfgContainer [2024-10-11 03:58:54,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:58:54,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:58:54,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:58:54,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:58:54,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:58:51" (1/3) ... [2024-10-11 03:58:54,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f31c05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:58:54, skipping insertion in model container [2024-10-11 03:58:54,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:58:52" (2/3) ... [2024-10-11 03:58:54,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f31c05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:58:54, skipping insertion in model container [2024-10-11 03:58:54,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:58:54" (3/3) ... [2024-10-11 03:58:54,155 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-2.i [2024-10-11 03:58:54,170 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:58:54,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:58:54,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:58:54,260 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;@72b935ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:58:54,261 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:58:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 03:58:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 03:58:54,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:54,289 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:58:54,289 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:54,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1941247954, now seen corresponding path program 1 times [2024-10-11 03:58:54,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493270544] [2024-10-11 03:58:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:54,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:58:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 03:58:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:58:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:58:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:58:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:58:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:58:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:58:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:58:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:58:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 03:58:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:54,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493270544] [2024-10-11 03:58:54,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493270544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:58:54,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:58:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:58:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259737266] [2024-10-11 03:58:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:58:54,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:58:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:54,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:58:54,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:58:54,940 INFO L87 Difference]: Start difference. First operand has 164 states, 100 states have (on average 1.49) internal successors, (149), 101 states have internal predecessors, (149), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 03:58:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:55,167 INFO L93 Difference]: Finished difference Result 330 states and 562 transitions. [2024-10-11 03:58:55,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:58:55,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-10-11 03:58:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:55,184 INFO L225 Difference]: With dead ends: 330 [2024-10-11 03:58:55,184 INFO L226 Difference]: Without dead ends: 165 [2024-10-11 03:58:55,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-11 03:58:55,194 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:55,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 485 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:58:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-11 03:58:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-10-11 03:58:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 100 states have (on average 1.44) internal successors, (144), 100 states have internal predecessors, (144), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 03:58:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 252 transitions. [2024-10-11 03:58:55,250 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 252 transitions. Word has length 71 [2024-10-11 03:58:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:55,250 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 252 transitions. [2024-10-11 03:58:55,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 03:58:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 252 transitions. [2024-10-11 03:58:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 03:58:55,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:55,257 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:58:55,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:58:55,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:55,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1410362118, now seen corresponding path program 1 times [2024-10-11 03:58:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:55,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151719086] [2024-10-11 03:58:55,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:55,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:58:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:58:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 03:58:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:58:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:58:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 03:58:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 03:58:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 03:58:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:58:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:58:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 03:58:55,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151719086] [2024-10-11 03:58:55,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151719086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:58:55,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:58:55,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:58:55,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267824191] [2024-10-11 03:58:55,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:58:55,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:58:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:58:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:58:55,591 INFO L87 Difference]: Start difference. First operand 163 states and 252 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 03:58:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:55,689 INFO L93 Difference]: Finished difference Result 325 states and 504 transitions. [2024-10-11 03:58:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:58:55,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-10-11 03:58:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:55,693 INFO L225 Difference]: With dead ends: 325 [2024-10-11 03:58:55,693 INFO L226 Difference]: Without dead ends: 164 [2024-10-11 03:58:55,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-11 03:58:55,700 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:55,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:58:55,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-11 03:58:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-10-11 03:58:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 101 states have internal predecessors, (145), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 03:58:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2024-10-11 03:58:55,733 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 74 [2024-10-11 03:58:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:55,734 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2024-10-11 03:58:55,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 03:58:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2024-10-11 03:58:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-11 03:58:55,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:55,743 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:58:55,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:58:55,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:55,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash 283034204, now seen corresponding path program 1 times [2024-10-11 03:58:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:55,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738786244] [2024-10-11 03:58:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:58:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:58:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 03:58:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 03:58:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 03:58:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 03:58:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 03:58:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 03:58:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 03:58:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 03:58:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 03:58:56,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:56,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738786244] [2024-10-11 03:58:56,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738786244] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:58:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989096247] [2024-10-11 03:58:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:58:56,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:58:56,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:58:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:56,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:58:56,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:58:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 03:58:56,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:58:56,596 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-11 03:58:56,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989096247] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:58:56,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:58:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-11 03:58:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13252475] [2024-10-11 03:58:56,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:58:56,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:58:56,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:56,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:58:56,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:58:56,600 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 03:58:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:56,681 INFO L93 Difference]: Finished difference Result 328 states and 508 transitions. [2024-10-11 03:58:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:58:56,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 75 [2024-10-11 03:58:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:56,685 INFO L225 Difference]: With dead ends: 328 [2024-10-11 03:58:56,685 INFO L226 Difference]: Without dead ends: 166 [2024-10-11 03:58:56,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:58:56,690 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:56,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 728 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:58:56,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-11 03:58:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-11 03:58:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 103 states have internal predecessors, (147), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 03:58:56,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 255 transitions. [2024-10-11 03:58:56,711 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 255 transitions. Word has length 75 [2024-10-11 03:58:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:56,711 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 255 transitions. [2024-10-11 03:58:56,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 03:58:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 255 transitions. [2024-10-11 03:58:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 03:58:56,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:56,718 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:58:56,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:58:56,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:56,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:56,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 799972892, now seen corresponding path program 2 times [2024-10-11 03:58:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:56,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620336785] [2024-10-11 03:58:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:56,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 03:58:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 03:58:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 03:58:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 03:58:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:58:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:58:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 03:58:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 03:58:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 03:58:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 03:58:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-10-11 03:58:57,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620336785] [2024-10-11 03:58:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620336785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:58:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515872307] [2024-10-11 03:58:57,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:58:57,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:57,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:58:57,259 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:58:57,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:58:57,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 03:58:57,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:58:57,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 03:58:57,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:58:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-11 03:58:57,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 03:58:57,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515872307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:58:57,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 03:58:57,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 03:58:57,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854246531] [2024-10-11 03:58:57,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:58:57,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:58:57,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:57,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:58:57,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:58:57,737 INFO L87 Difference]: Start difference. First operand 166 states and 255 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 03:58:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:58:57,831 INFO L93 Difference]: Finished difference Result 321 states and 504 transitions. [2024-10-11 03:58:57,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:58:57,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 77 [2024-10-11 03:58:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:58:57,840 INFO L225 Difference]: With dead ends: 321 [2024-10-11 03:58:57,840 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 03:58:57,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:58:57,844 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 200 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 874 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:58:57,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 874 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:58:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 03:58:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-11 03:58:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 181 states have (on average 1.4585635359116023) internal successors, (264), 181 states have internal predecessors, (264), 97 states have call successors, (97), 16 states have call predecessors, (97), 16 states have return successors, (105), 97 states have call predecessors, (105), 97 states have call successors, (105) [2024-10-11 03:58:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 466 transitions. [2024-10-11 03:58:57,890 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 466 transitions. Word has length 77 [2024-10-11 03:58:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:58:57,890 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 466 transitions. [2024-10-11 03:58:57,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 03:58:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 466 transitions. [2024-10-11 03:58:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 03:58:57,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:58:57,894 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:58:57,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:58:58,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:58,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:58:58,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:58:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1390367869, now seen corresponding path program 1 times [2024-10-11 03:58:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:58:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022572634] [2024-10-11 03:58:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:58,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:58:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 03:58:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:58:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:58:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:58:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:58:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:58:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:58:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:58:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:58:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:58:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:58:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:58:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:58:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 03:58:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:58:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:58:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:58:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 03:58:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:58:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:58:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:58:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-10-11 03:58:58,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:58:58,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022572634] [2024-10-11 03:58:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022572634] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:58:58,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583710979] [2024-10-11 03:58:58,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:58:58,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:58:58,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:58:58,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:58:58,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:58:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:58:59,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 03:58:59,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:58:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-10-11 03:58:59,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:58:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2024-10-11 03:58:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583710979] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:58:59,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:58:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 9 [2024-10-11 03:58:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020380061] [2024-10-11 03:58:59,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:58:59,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 03:58:59,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:58:59,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 03:58:59,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:58:59,514 INFO L87 Difference]: Start difference. First operand 295 states and 466 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 03:59:01,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:02,413 INFO L93 Difference]: Finished difference Result 598 states and 951 transitions. [2024-10-11 03:59:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:59:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 138 [2024-10-11 03:59:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:02,419 INFO L225 Difference]: With dead ends: 598 [2024-10-11 03:59:02,420 INFO L226 Difference]: Without dead ends: 311 [2024-10-11 03:59:02,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:59:02,425 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 79 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:02,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 735 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 03:59:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-11 03:59:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2024-10-11 03:59:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 189 states have (on average 1.4444444444444444) internal successors, (273), 191 states have internal predecessors, (273), 97 states have call successors, (97), 16 states have call predecessors, (97), 18 states have return successors, (111), 97 states have call predecessors, (111), 97 states have call successors, (111) [2024-10-11 03:59:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 481 transitions. [2024-10-11 03:59:02,466 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 481 transitions. Word has length 138 [2024-10-11 03:59:02,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:02,466 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 481 transitions. [2024-10-11 03:59:02,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (43), 6 states have call predecessors, (43), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 03:59:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 481 transitions. [2024-10-11 03:59:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:59:02,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:02,472 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:59:02,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:59:02,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:59:02,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:02,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:02,674 INFO L85 PathProgramCache]: Analyzing trace with hash 494382953, now seen corresponding path program 1 times [2024-10-11 03:59:02,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:02,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931974903] [2024-10-11 03:59:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:59:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:59:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:59:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:59:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:59:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:59:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:59:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:59:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 03:59:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:59:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:59:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:59:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 03:59:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:59:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:59:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:59:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 03:59:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 03:59:03,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:03,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931974903] [2024-10-11 03:59:03,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931974903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:59:03,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:59:03,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:59:03,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537904759] [2024-10-11 03:59:03,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:59:03,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:59:03,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:59:03,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:59:03,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:59:03,585 INFO L87 Difference]: Start difference. First operand 305 states and 481 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 03:59:07,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:10,011 INFO L93 Difference]: Finished difference Result 643 states and 1031 transitions. [2024-10-11 03:59:10,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:59:10,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2024-10-11 03:59:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:10,022 INFO L225 Difference]: With dead ends: 643 [2024-10-11 03:59:10,022 INFO L226 Difference]: Without dead ends: 613 [2024-10-11 03:59:10,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:59:10,024 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 392 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 346 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:10,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 644 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 540 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-10-11 03:59:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-11 03:59:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 595. [2024-10-11 03:59:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 362 states have (on average 1.4530386740331491) internal successors, (526), 369 states have internal predecessors, (526), 193 states have call successors, (193), 32 states have call predecessors, (193), 39 states have return successors, (237), 193 states have call predecessors, (237), 193 states have call successors, (237) [2024-10-11 03:59:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 956 transitions. [2024-10-11 03:59:10,105 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 956 transitions. Word has length 144 [2024-10-11 03:59:10,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:10,105 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 956 transitions. [2024-10-11 03:59:10,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 03:59:10,106 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 956 transitions. [2024-10-11 03:59:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:59:10,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:10,110 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:59:10,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:59:10,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:10,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1655244699, now seen corresponding path program 2 times [2024-10-11 03:59:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124260025] [2024-10-11 03:59:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 03:59:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:59:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:59:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:59:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:59:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:59:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:59:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:59:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 03:59:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:59:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:59:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:59:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 03:59:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:59:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:59:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:59:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 03:59:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 03:59:10,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:10,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124260025] [2024-10-11 03:59:10,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124260025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:59:10,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:59:10,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:59:10,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141203010] [2024-10-11 03:59:10,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:59:10,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:59:10,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:59:10,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:59:10,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:59:10,891 INFO L87 Difference]: Start difference. First operand 595 states and 956 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 03:59:15,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:19,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:23,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:24,436 INFO L93 Difference]: Finished difference Result 971 states and 1546 transitions. [2024-10-11 03:59:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:59:24,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2024-10-11 03:59:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:24,441 INFO L225 Difference]: With dead ends: 971 [2024-10-11 03:59:24,442 INFO L226 Difference]: Without dead ends: 603 [2024-10-11 03:59:24,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:59:24,444 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 278 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 107 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:24,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 851 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 649 Invalid, 3 Unknown, 0 Unchecked, 13.3s Time] [2024-10-11 03:59:24,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-10-11 03:59:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 585. [2024-10-11 03:59:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 355 states have (on average 1.4507042253521127) internal successors, (515), 361 states have internal predecessors, (515), 191 states have call successors, (191), 32 states have call predecessors, (191), 38 states have return successors, (231), 191 states have call predecessors, (231), 191 states have call successors, (231) [2024-10-11 03:59:24,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 937 transitions. [2024-10-11 03:59:24,499 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 937 transitions. Word has length 144 [2024-10-11 03:59:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:24,499 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 937 transitions. [2024-10-11 03:59:24,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 03:59:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 937 transitions. [2024-10-11 03:59:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:59:24,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:24,504 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:59:24,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:59:24,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1863590095, now seen corresponding path program 1 times [2024-10-11 03:59:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909211728] [2024-10-11 03:59:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 03:59:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:59:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:59:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:59:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:59:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:59:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:59:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:59:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 03:59:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:59:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:59:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:59:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 03:59:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:59:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:59:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:59:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 03:59:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 03:59:25,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:25,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909211728] [2024-10-11 03:59:25,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909211728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:59:25,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:59:25,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:59:25,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105494034] [2024-10-11 03:59:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:59:25,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:59:25,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:59:25,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:59:25,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:59:25,289 INFO L87 Difference]: Start difference. First operand 585 states and 937 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 03:59:30,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:31,717 INFO L93 Difference]: Finished difference Result 1097 states and 1744 transitions. [2024-10-11 03:59:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:59:31,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2024-10-11 03:59:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:31,723 INFO L225 Difference]: With dead ends: 1097 [2024-10-11 03:59:31,723 INFO L226 Difference]: Without dead ends: 530 [2024-10-11 03:59:31,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:59:31,726 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 266 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 106 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:31,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 938 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 774 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2024-10-11 03:59:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-11 03:59:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 514. [2024-10-11 03:59:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 314 states have (on average 1.3630573248407643) internal successors, (428), 319 states have internal predecessors, (428), 164 states have call successors, (164), 29 states have call predecessors, (164), 35 states have return successors, (193), 165 states have call predecessors, (193), 164 states have call successors, (193) [2024-10-11 03:59:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 785 transitions. [2024-10-11 03:59:31,770 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 785 transitions. Word has length 144 [2024-10-11 03:59:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:31,770 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 785 transitions. [2024-10-11 03:59:31,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 03:59:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 785 transitions. [2024-10-11 03:59:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 03:59:31,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:31,774 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:59:31,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:59:31,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:31,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash 964601399, now seen corresponding path program 1 times [2024-10-11 03:59:31,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:31,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374306870] [2024-10-11 03:59:31,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:31,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:59:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:59:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 03:59:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 03:59:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 03:59:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 03:59:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 03:59:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:59:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 03:59:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 03:59:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 03:59:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 03:59:32,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 03:59:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 03:59:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 03:59:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 03:59:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 03:59:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 03:59:32,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:32,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374306870] [2024-10-11 03:59:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374306870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:59:32,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:59:32,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:59:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284665120] [2024-10-11 03:59:32,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:59:32,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:59:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:59:32,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:59:32,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:59:32,902 INFO L87 Difference]: Start difference. First operand 514 states and 785 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 03:59:36,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:37,737 INFO L93 Difference]: Finished difference Result 570 states and 864 transitions. [2024-10-11 03:59:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:59:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2024-10-11 03:59:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:37,741 INFO L225 Difference]: With dead ends: 570 [2024-10-11 03:59:37,741 INFO L226 Difference]: Without dead ends: 445 [2024-10-11 03:59:37,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:59:37,743 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 395 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:37,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 737 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 03:59:37,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-11 03:59:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 429. [2024-10-11 03:59:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 266 states have (on average 1.3759398496240602) internal successors, (366), 270 states have internal predecessors, (366), 132 states have call successors, (132), 25 states have call predecessors, (132), 30 states have return successors, (157), 133 states have call predecessors, (157), 132 states have call successors, (157) [2024-10-11 03:59:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 655 transitions. [2024-10-11 03:59:37,788 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 655 transitions. Word has length 144 [2024-10-11 03:59:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 655 transitions. [2024-10-11 03:59:37,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 03:59:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 655 transitions. [2024-10-11 03:59:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 03:59:37,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:37,793 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:59:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:59:37,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:37,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1204776282, now seen corresponding path program 1 times [2024-10-11 03:59:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085050446] [2024-10-11 03:59:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:37,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:59:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:59:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:59:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:59:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 03:59:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:59:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:59:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:59:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:59:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:59:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:59:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:59:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:59:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 03:59:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 03:59:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 03:59:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:59:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 03:59:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 03:59:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 03:59:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 03:59:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 03:59:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 03:59:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 03:59:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-10-11 03:59:38,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085050446] [2024-10-11 03:59:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085050446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:59:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549712059] [2024-10-11 03:59:38,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:38,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:59:38,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:59:38,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:59:38,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:59:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:39,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 1477 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 03:59:39,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:59:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 320 proven. 4 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2024-10-11 03:59:39,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:59:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2024-10-11 03:59:40,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549712059] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:59:40,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:59:40,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 16 [2024-10-11 03:59:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795464287] [2024-10-11 03:59:40,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:59:40,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 03:59:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:59:40,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 03:59:40,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-10-11 03:59:40,168 INFO L87 Difference]: Start difference. First operand 429 states and 655 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 12 states have internal predecessors, (93), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2024-10-11 03:59:41,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 03:59:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:59:44,290 INFO L93 Difference]: Finished difference Result 1071 states and 1681 transitions. [2024-10-11 03:59:44,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 03:59:44,291 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 12 states have internal predecessors, (93), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) Word has length 197 [2024-10-11 03:59:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:59:44,297 INFO L225 Difference]: With dead ends: 1071 [2024-10-11 03:59:44,297 INFO L226 Difference]: Without dead ends: 678 [2024-10-11 03:59:44,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-10-11 03:59:44,301 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 761 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:59:44,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 955 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 03:59:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-10-11 03:59:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 653. [2024-10-11 03:59:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 398 states have (on average 1.4020100502512562) internal successors, (558), 405 states have internal predecessors, (558), 205 states have call successors, (205), 43 states have call predecessors, (205), 49 states have return successors, (249), 204 states have call predecessors, (249), 205 states have call successors, (249) [2024-10-11 03:59:44,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1012 transitions. [2024-10-11 03:59:44,377 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1012 transitions. Word has length 197 [2024-10-11 03:59:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:59:44,377 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1012 transitions. [2024-10-11 03:59:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 12 states have internal predecessors, (93), 9 states have call successors, (56), 8 states have call predecessors, (56), 7 states have return successors, (51), 7 states have call predecessors, (51), 9 states have call successors, (51) [2024-10-11 03:59:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1012 transitions. [2024-10-11 03:59:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 03:59:44,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:59:44,384 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 8, 8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:59:44,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:59:44,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 03:59:44,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:59:44,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:59:44,589 INFO L85 PathProgramCache]: Analyzing trace with hash -911884828, now seen corresponding path program 1 times [2024-10-11 03:59:44,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:59:44,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669433628] [2024-10-11 03:59:44,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:44,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:59:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:59:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 03:59:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 03:59:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:59:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 03:59:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 03:59:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 03:59:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 03:59:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 03:59:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 03:59:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 03:59:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 03:59:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 03:59:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 03:59:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 03:59:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 03:59:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 03:59:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 03:59:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 03:59:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 03:59:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 03:59:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-11 03:59:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 03:59:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 03:59:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 03:59:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2024-10-11 03:59:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:59:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669433628] [2024-10-11 03:59:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669433628] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:59:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946486421] [2024-10-11 03:59:48,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:59:48,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:59:48,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:59:48,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:59:48,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 03:59:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:59:49,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 03:59:49,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:59:49,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 03:59:57,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 03:59:57,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 03:59:57,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2024-10-11 04:00:02,104 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2024-10-11 04:00:02,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104