./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:49:33,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:49:33,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:49:33,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:49:33,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:49:33,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:49:33,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:49:33,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:49:33,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:49:33,225 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:49:33,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:49:33,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:49:33,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:49:33,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:49:33,226 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:49:33,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:49:33,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:49:33,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:49:33,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:49:33,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:49:33,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:49:33,229 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:49:33,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:49:33,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:49:33,230 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:49:33,230 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:49:33,231 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:49:33,231 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:49:33,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:49:33,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:49:33,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:49:33,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:49:33,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:49:33,232 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:49:33,232 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:49:33,232 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:49:33,233 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:49:33,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:49:33,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:49:33,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:49:33,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:49:33,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:49:33,234 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-11-19 20:49:33,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:49:33,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:49:33,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:49:33,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:49:33,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:49:33,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-19 20:49:34,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:49:34,977 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:49:34,977 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-19 20:49:34,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7217c0a1/771ea0ba29b34228bf7b63b829aa2df1/FLAG2f11f957a [2024-11-19 20:49:35,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7217c0a1/771ea0ba29b34228bf7b63b829aa2df1 [2024-11-19 20:49:35,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:49:35,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:49:35,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:49:35,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:49:35,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:49:35,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187c80e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35, skipping insertion in model container [2024-11-19 20:49:35,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:49:35,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-19 20:49:35,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:49:35,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:49:35,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-19 20:49:35,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:49:35,455 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:49:35,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35 WrapperNode [2024-11-19 20:49:35,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:49:35,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:49:35,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:49:35,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:49:35,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,502 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 124 [2024-11-19 20:49:35,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:49:35,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:49:35,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:49:35,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:49:35,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,542 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 6, 13]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 1, 8]. [2024-11-19 20:49:35,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:49:35,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:49:35,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:49:35,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:49:35,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (1/1) ... [2024-11-19 20:49:35,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:49:35,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:35,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:49:35,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:49:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:49:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:49:35,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 20:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-19 20:49:35,653 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-19 20:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:49:35,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 20:49:35,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:49:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:49:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:49:35,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:49:35,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:49:35,761 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:49:35,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:49:35,900 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-19 20:49:35,900 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:49:35,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:49:35,912 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 20:49:35,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:49:35 BoogieIcfgContainer [2024-11-19 20:49:35,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:49:35,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:49:35,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:49:35,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:49:35,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:49:35" (1/3) ... [2024-11-19 20:49:35,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20253429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:49:35, skipping insertion in model container [2024-11-19 20:49:35,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:49:35" (2/3) ... [2024-11-19 20:49:35,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20253429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:49:35, skipping insertion in model container [2024-11-19 20:49:35,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:49:35" (3/3) ... [2024-11-19 20:49:35,919 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-19 20:49:35,934 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:49:35,934 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:49:35,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:49:35,983 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;@63d3ca75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:49:35,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:49:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:49:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 20:49:35,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:35,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:35,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:35,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash 308507763, now seen corresponding path program 1 times [2024-11-19 20:49:36,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:36,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687262497] [2024-11-19 20:49:36,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:36,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:36,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:49:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:36,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:36,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687262497] [2024-11-19 20:49:36,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687262497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:36,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:36,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:49:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700406130] [2024-11-19 20:49:36,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:36,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:49:36,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:49:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:49:36,357 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:49:36,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:36,404 INFO L93 Difference]: Finished difference Result 57 states and 79 transitions. [2024-11-19 20:49:36,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:49:36,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 20:49:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:36,412 INFO L225 Difference]: With dead ends: 57 [2024-11-19 20:49:36,412 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 20:49:36,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:49:36,419 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:36,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 20:49:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-19 20:49:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:49:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-19 20:49:36,451 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2024-11-19 20:49:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:36,451 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-19 20:49:36,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:49:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-19 20:49:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 20:49:36,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:36,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:36,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:49:36,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:36,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash -2109805219, now seen corresponding path program 1 times [2024-11-19 20:49:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761868086] [2024-11-19 20:49:36,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:36,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 20:49:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:36,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:36,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761868086] [2024-11-19 20:49:36,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761868086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:36,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:36,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:49:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277718487] [2024-11-19 20:49:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:36,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:49:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:36,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:49:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:49:36,614 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:49:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:36,651 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-11-19 20:49:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:49:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-19 20:49:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:36,652 INFO L225 Difference]: With dead ends: 50 [2024-11-19 20:49:36,653 INFO L226 Difference]: Without dead ends: 31 [2024-11-19 20:49:36,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:49:36,655 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:36,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 72 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-19 20:49:36,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-19 20:49:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:49:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-19 20:49:36,666 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2024-11-19 20:49:36,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:36,666 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-19 20:49:36,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:49:36,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-19 20:49:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:49:36,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:36,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:36,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:49:36,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:36,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash 493100305, now seen corresponding path program 1 times [2024-11-19 20:49:36,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:36,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487426087] [2024-11-19 20:49:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:36,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:49:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:36,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 20:49:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:49:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:36,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487426087] [2024-11-19 20:49:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487426087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:36,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:49:36,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:49:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775892621] [2024-11-19 20:49:36,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:36,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:49:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:36,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:49:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:49:36,832 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:49:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:36,877 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2024-11-19 20:49:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:49:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-19 20:49:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:36,879 INFO L225 Difference]: With dead ends: 54 [2024-11-19 20:49:36,880 INFO L226 Difference]: Without dead ends: 30 [2024-11-19 20:49:36,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:49:36,881 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:36,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-19 20:49:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-19 20:49:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:49:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-19 20:49:36,890 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 27 [2024-11-19 20:49:36,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:36,891 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-19 20:49:36,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:49:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-19 20:49:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:49:36,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:36,892 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:36,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:49:36,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1095247597, now seen corresponding path program 1 times [2024-11-19 20:49:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419644641] [2024-11-19 20:49:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:49:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 20:49:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:49:37,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:37,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419644641] [2024-11-19 20:49:37,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419644641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:37,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528456208] [2024-11-19 20:49:37,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:37,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:37,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:37,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:49:37,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:49:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:37,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:49:37,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:37,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:49:37,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 20:49:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528456208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:49:37,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:49:37,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-19 20:49:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902209554] [2024-11-19 20:49:37,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:49:37,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:49:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:49:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:49:37,274 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:49:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:37,313 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-19 20:49:37,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:49:37,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-19 20:49:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:37,315 INFO L225 Difference]: With dead ends: 51 [2024-11-19 20:49:37,315 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 20:49:37,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:49:37,316 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:37,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 118 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 20:49:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 20:49:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:49:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-11-19 20:49:37,321 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 27 [2024-11-19 20:49:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:37,321 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-11-19 20:49:37,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 20:49:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-11-19 20:49:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:49:37,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:37,322 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:37,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 20:49:37,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:37,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:37,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash -292922041, now seen corresponding path program 1 times [2024-11-19 20:49:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:37,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724291956] [2024-11-19 20:49:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:37,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:37,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:49:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:37,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:49:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:37,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:49:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 20:49:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:37,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724291956] [2024-11-19 20:49:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724291956] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248292292] [2024-11-19 20:49:37,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:37,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:37,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:49:37,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:49:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:38,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 20:49:38,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:38,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 20:49:38,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:49:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 20:49:38,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:49:38,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248292292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:49:38,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:49:38,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 16 [2024-11-19 20:49:38,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33064228] [2024-11-19 20:49:38,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:49:38,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 20:49:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:38,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 20:49:38,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:49:38,202 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:49:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:38,261 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-19 20:49:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:49:38,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-19 20:49:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:38,263 INFO L225 Difference]: With dead ends: 45 [2024-11-19 20:49:38,263 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 20:49:38,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-19 20:49:38,264 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:38,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 177 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:49:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 20:49:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2024-11-19 20:49:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:49:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-19 20:49:38,270 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2024-11-19 20:49:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:38,270 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-19 20:49:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:49:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-19 20:49:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:49:38,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:38,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:38,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 20:49:38,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:38,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:38,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:38,473 INFO L85 PathProgramCache]: Analyzing trace with hash -292920367, now seen corresponding path program 1 times [2024-11-19 20:49:38,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:38,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554525275] [2024-11-19 20:49:38,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:38,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:49:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:38,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:49:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:49:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 20:49:38,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:38,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554525275] [2024-11-19 20:49:38,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554525275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:38,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42383700] [2024-11-19 20:49:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:38,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:38,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:38,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:49:38,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:49:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:38,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 20:49:38,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:38,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:49:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:49:38,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 20:49:39,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42383700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:49:39,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:49:39,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 14 [2024-11-19 20:49:39,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207219261] [2024-11-19 20:49:39,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:49:39,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 20:49:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:39,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 20:49:39,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-19 20:49:39,022 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:49:43,039 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 [0] [2024-11-19 20:49:47,067 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 [0] [2024-11-19 20:49:51,085 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 [0] [2024-11-19 20:49:55,113 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 [0] [2024-11-19 20:49:59,134 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 [0] [2024-11-19 20:49:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:49:59,260 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2024-11-19 20:49:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 20:49:59,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-19 20:49:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:49:59,261 INFO L225 Difference]: With dead ends: 63 [2024-11-19 20:49:59,261 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 20:49:59,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-19 20:49:59,262 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:49:59,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 238 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-19 20:49:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 20:49:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 20:49:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:49:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-11-19 20:49:59,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 37 [2024-11-19 20:49:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:49:59,267 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-11-19 20:49:59,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-19 20:49:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-11-19 20:49:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:49:59,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:49:59,268 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:49:59,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:49:59,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:59,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:49:59,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:49:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1499731437, now seen corresponding path program 1 times [2024-11-19 20:49:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:49:59,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189112990] [2024-11-19 20:49:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:49:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:49:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:49:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:49:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 20:49:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:49:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189112990] [2024-11-19 20:49:59,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189112990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:49:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445190473] [2024-11-19 20:49:59,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:49:59,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:49:59,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:49:59,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:49:59,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:49:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:49:59,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 20:49:59,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:49:59,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-19 20:49:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:49:59,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:49:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-19 20:49:59,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445190473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:49:59,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:49:59,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 12 [2024-11-19 20:49:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802042248] [2024-11-19 20:49:59,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:49:59,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 20:49:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:49:59,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 20:49:59,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:49:59,916 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:50:03,932 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 [0] [2024-11-19 20:50:07,963 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 [0] [2024-11-19 20:50:11,974 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 [0] [2024-11-19 20:50:15,999 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 [0] [2024-11-19 20:50:20,019 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 [0] [2024-11-19 20:50:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:20,126 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-19 20:50:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 20:50:20,127 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-19 20:50:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:20,128 INFO L225 Difference]: With dead ends: 44 [2024-11-19 20:50:20,128 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 20:50:20,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-19 20:50:20,129 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:20,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 188 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-11-19 20:50:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 20:50:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-19 20:50:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:50:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-19 20:50:20,133 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 40 [2024-11-19 20:50:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:20,133 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-19 20:50:20,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:50:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-19 20:50:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:50:20,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:20,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:20,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 20:50:20,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:20,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:20,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:20,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1499729763, now seen corresponding path program 1 times [2024-11-19 20:50:20,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:20,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251320040] [2024-11-19 20:50:20,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:20,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:21,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:50:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:50:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:50:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:50:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251320040] [2024-11-19 20:50:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251320040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563916262] [2024-11-19 20:50:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:21,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:21,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:21,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:21,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:50:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:21,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-19 20:50:21,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:21,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 20:50:22,117 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:50:22,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:50:22,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-19 20:50:22,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 20:50:22,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:50:22,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:50:22,677 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:50:22,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:50:22,698 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-19 20:50:22,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 20:50:22,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-19 20:50:22,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-19 20:50:22,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:50:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:23,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:26,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563916262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:26,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:50:26,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 47 [2024-11-19 20:50:26,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300955719] [2024-11-19 20:50:26,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:26,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-19 20:50:26,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:26,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-19 20:50:26,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2337, Unknown=48, NotChecked=0, Total=2550 [2024-11-19 20:50:26,732 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 47 states, 45 states have (on average 1.4) internal successors, (63), 38 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:50:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:27,833 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2024-11-19 20:50:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 20:50:27,834 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 45 states have (on average 1.4) internal successors, (63), 38 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-19 20:50:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:27,834 INFO L225 Difference]: With dead ends: 54 [2024-11-19 20:50:27,834 INFO L226 Difference]: Without dead ends: 52 [2024-11-19 20:50:27,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=298, Invalid=3944, Unknown=48, NotChecked=0, Total=4290 [2024-11-19 20:50:27,836 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:27,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 408 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 20:50:27,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-19 20:50:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-11-19 20:50:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:50:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-11-19 20:50:27,842 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2024-11-19 20:50:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:27,842 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-11-19 20:50:27,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 45 states have (on average 1.4) internal successors, (63), 38 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:50:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-11-19 20:50:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:50:27,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:27,845 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:27,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 20:50:28,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:28,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:28,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:28,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1868742190, now seen corresponding path program 1 times [2024-11-19 20:50:28,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:28,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981036573] [2024-11-19 20:50:28,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:28,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:50:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:28,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:50:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:50:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 20:50:29,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981036573] [2024-11-19 20:50:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981036573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630847977] [2024-11-19 20:50:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:29,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:29,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:29,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:29,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:50:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:29,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-19 20:50:29,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:29,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 20:50:29,310 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:50:29,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:50:29,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-11-19 20:50:29,387 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 20:50:29,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-11-19 20:50:29,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 18 [2024-11-19 20:50:29,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:50:29,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:50:29,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 51 [2024-11-19 20:50:29,758 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-19 20:50:29,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-19 20:50:29,997 INFO L349 Elim1Store]: treesize reduction 34, result has 61.4 percent of original size [2024-11-19 20:50:29,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 90 [2024-11-19 20:50:30,019 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-19 20:50:30,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 92 [2024-11-19 20:50:30,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 20:50:30,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-19 20:50:30,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-11-19 20:50:30,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-19 20:50:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:30,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630847977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:35,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:50:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 40 [2024-11-19 20:50:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664168889] [2024-11-19 20:50:35,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:35,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 20:50:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 20:50:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2023, Unknown=5, NotChecked=0, Total=2162 [2024-11-19 20:50:35,897 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:50:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:37,070 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-19 20:50:37,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 20:50:37,071 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-11-19 20:50:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:37,072 INFO L225 Difference]: With dead ends: 59 [2024-11-19 20:50:37,072 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 20:50:37,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=307, Invalid=3978, Unknown=5, NotChecked=0, Total=4290 [2024-11-19 20:50:37,074 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:37,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 401 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 20:50:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 20:50:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2024-11-19 20:50:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:50:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-19 20:50:37,079 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 42 [2024-11-19 20:50:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:37,079 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-19 20:50:37,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 33 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 20:50:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-19 20:50:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:50:37,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:37,080 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:50:37,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 20:50:37,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:37,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:37,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:37,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1422189688, now seen corresponding path program 1 times [2024-11-19 20:50:37,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:37,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639984431] [2024-11-19 20:50:37,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:37,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:50:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:50:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:50:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:50:38,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639984431] [2024-11-19 20:50:38,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639984431] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:38,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236279282] [2024-11-19 20:50:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:38,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:38,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:38,714 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:38,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:50:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:38,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-19 20:50:38,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:38,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 20:50:39,191 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:50:39,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:50:39,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:50:39,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-19 20:50:39,311 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:50:39,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 20:50:39,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 20:50:39,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-19 20:50:39,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:50:39,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:50:39,765 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:50:39,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:50:39,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:50:39,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2024-11-19 20:50:39,789 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:50:39,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 20:50:40,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-19 20:50:40,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2024-11-19 20:50:40,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 20:50:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:40,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236279282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:48,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:50:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 20:50:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761705450] [2024-11-19 20:50:48,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:48,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 20:50:48,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:48,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 20:50:48,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2945, Unknown=74, NotChecked=0, Total=3192 [2024-11-19 20:50:48,811 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:50:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:50:50,487 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2024-11-19 20:50:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 20:50:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2024-11-19 20:50:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:50:50,488 INFO L225 Difference]: With dead ends: 59 [2024-11-19 20:50:50,488 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 20:50:50,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1324 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=373, Invalid=5713, Unknown=76, NotChecked=0, Total=6162 [2024-11-19 20:50:50,490 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 20:50:50,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 485 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 20:50:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 20:50:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2024-11-19 20:50:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:50:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2024-11-19 20:50:50,497 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 42 [2024-11-19 20:50:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:50:50,497 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2024-11-19 20:50:50,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.4) internal successors, (70), 43 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:50:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2024-11-19 20:50:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 20:50:50,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:50:50,498 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-19 20:50:50,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 20:50:50,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:50,699 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:50:50,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:50:50,700 INFO L85 PathProgramCache]: Analyzing trace with hash 924724691, now seen corresponding path program 1 times [2024-11-19 20:50:50,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:50:50,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714973795] [2024-11-19 20:50:50,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:50:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:52,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:50:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:52,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:50:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:50:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:50:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:50:53,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714973795] [2024-11-19 20:50:53,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714973795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:53,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604199857] [2024-11-19 20:50:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:50:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:50:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:50:53,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:50:53,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 20:50:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:50:53,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 164 conjuncts are in the unsatisfiable core [2024-11-19 20:50:53,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:50:53,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 20:50:53,510 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 11 treesize of output 7 [2024-11-19 20:50:53,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2024-11-19 20:50:53,827 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 20:50:53,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-19 20:50:53,844 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:50:53,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:50:53,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:50:53,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 20:50:53,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:50:54,004 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:50:54,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 81 [2024-11-19 20:50:54,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 20:50:54,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-19 20:50:54,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-19 20:50:54,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:50:54,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:50:54,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-19 20:50:54,620 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-19 20:50:54,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-19 20:50:54,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:50:54,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 42 [2024-11-19 20:50:54,650 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-19 20:50:54,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 31 [2024-11-19 20:50:54,678 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:50:54,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 20:50:55,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2024-11-19 20:50:55,441 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2024-11-19 20:50:55,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 53 [2024-11-19 20:50:55,464 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2024-11-19 20:50:55,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 108 [2024-11-19 20:50:55,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2024-11-19 20:50:55,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:50:55,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-19 20:50:55,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:50:55,492 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-19 20:50:55,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2024-11-19 20:50:55,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-11-19 20:50:55,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2024-11-19 20:50:55,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-19 20:50:55,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:50:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:50:55,775 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:50:56,140 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1947 Int) (v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1951 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 v_ArrVal_1947)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1954) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1952) .cse1) .cse2)) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1951) .cse1) .cse2))))) is different from false [2024-11-19 20:50:57,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604199857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:50:57,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:50:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 54 [2024-11-19 20:50:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326319960] [2024-11-19 20:50:57,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:50:57,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-19 20:50:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:50:57,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-19 20:50:57,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3584, Unknown=1, NotChecked=120, Total=3906 [2024-11-19 20:50:57,145 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 54 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 45 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:51:00,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:00,000 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2024-11-19 20:51:00,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-19 20:51:00,000 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 45 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2024-11-19 20:51:00,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:00,001 INFO L225 Difference]: With dead ends: 60 [2024-11-19 20:51:00,001 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 20:51:00,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=439, Invalid=7046, Unknown=1, NotChecked=170, Total=7656 [2024-11-19 20:51:00,003 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:00,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 463 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 20:51:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 20:51:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2024-11-19 20:51:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 20:51:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-19 20:51:00,010 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 44 [2024-11-19 20:51:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:00,010 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-19 20:51:00,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 45 states have internal predecessors, (71), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:51:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-19 20:51:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 20:51:00,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:00,011 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:00,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:00,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-19 20:51:00,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:00,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 478170515, now seen corresponding path program 2 times [2024-11-19 20:51:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415862986] [2024-11-19 20:51:00,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:51:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:01,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:51:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:02,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415862986] [2024-11-19 20:51:02,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415862986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273892399] [2024-11-19 20:51:02,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:51:02,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:02,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:02,132 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:51:02,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 20:51:02,336 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:51:02,336 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:51:02,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 119 conjuncts are in the unsatisfiable core [2024-11-19 20:51:02,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:02,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 20:51:02,499 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-11-19 20:51:02,504 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-11-19 20:51:02,821 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 20:51:02,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-19 20:51:02,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:51:02,844 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 20:51:02,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2024-11-19 20:51:02,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 20:51:02,871 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:51:02,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:51:02,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 20:51:02,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:51:02,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-19 20:51:02,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 20:51:03,061 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-19 20:51:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 89 [2024-11-19 20:51:03,075 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-11-19 20:51:03,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 79 [2024-11-19 20:51:03,449 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-19 20:51:03,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 44 [2024-11-19 20:51:03,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 20:51:03,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:51:03,597 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_node_create_~temp~0#1.base_66| Int)) (and (= (store |c_old(#memory_$Pointer$#2.base)| |v_node_create_~temp~0#1.base_66| (select |c_#memory_$Pointer$#2.base| |v_node_create_~temp~0#1.base_66|)) |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_66|) 0) (= |c_#memory_$Pointer$#2.offset| (store |c_old(#memory_$Pointer$#2.offset)| |v_node_create_~temp~0#1.base_66| (select |c_#memory_$Pointer$#2.offset| |v_node_create_~temp~0#1.base_66|))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 0) 0))) is different from true [2024-11-19 20:51:03,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:51:03,623 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-19 20:51:03,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 90 [2024-11-19 20:51:03,641 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-19 20:51:03,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-19 20:51:03,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2024-11-19 20:51:04,004 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-19 20:51:04,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 39 [2024-11-19 20:51:04,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-19 20:51:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-19 20:51:04,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:51:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273892399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:04,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:51:04,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 51 [2024-11-19 20:51:04,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569051412] [2024-11-19 20:51:04,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:51:04,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-19 20:51:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:51:04,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-19 20:51:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2822, Unknown=1, NotChecked=106, Total=3080 [2024-11-19 20:51:04,513 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 43 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:51:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:51:07,994 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2024-11-19 20:51:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-19 20:51:07,994 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 43 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2024-11-19 20:51:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:51:07,995 INFO L225 Difference]: With dead ends: 96 [2024-11-19 20:51:07,995 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 20:51:07,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=386, Invalid=7099, Unknown=1, NotChecked=170, Total=7656 [2024-11-19 20:51:07,997 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 20:51:07,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 436 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1373 Invalid, 0 Unknown, 79 Unchecked, 1.4s Time] [2024-11-19 20:51:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 20:51:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2024-11-19 20:51:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.121212121212121) internal successors, (74), 66 states have internal predecessors, (74), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 20:51:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-11-19 20:51:08,007 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 44 [2024-11-19 20:51:08,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:51:08,007 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-11-19 20:51:08,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 43 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 20:51:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-11-19 20:51:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 20:51:08,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:51:08,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:51:08,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 20:51:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:08,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:51:08,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:51:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash -397769244, now seen corresponding path program 1 times [2024-11-19 20:51:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:51:08,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495497212] [2024-11-19 20:51:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:08,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:51:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:09,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 20:51:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:09,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:51:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:51:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 20:51:10,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:51:10,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495497212] [2024-11-19 20:51:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495497212] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:51:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165316153] [2024-11-19 20:51:10,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:51:10,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:51:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:51:10,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:51:10,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 20:51:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:51:10,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-19 20:51:10,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:51:10,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 20:51:10,752 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-19 20:51:10,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-19 20:51:10,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:10,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 20:51:10,870 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-19 20:51:10,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-19 20:51:10,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-19 20:51:11,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-19 20:51:11,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 20:51:11,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3