./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.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.graphml --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 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 15:01:19,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 15:01:19,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 15:01:19,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 15:01:19,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 15:01:19,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 15:01:19,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 15:01:19,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 15:01:19,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 15:01:19,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 15:01:19,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 15:01:19,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 15:01:19,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 15:01:19,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 15:01:19,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 15:01:19,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 15:01:19,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 15:01:19,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 15:01:19,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 15:01:19,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 15:01:19,660 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 15:01:19,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 15:01:19,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 15:01:19,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 15:01:19,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 15:01:19,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 15:01:19,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 15:01:19,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 15:01:19,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 15:01:19,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 15:01:19,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 15:01:19,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 15:01:19,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 15:01:19,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 15:01:19,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 15:01:19,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 15:01:19,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 15:01:19,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 15:01:19,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 15:01:19,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 15:01:19,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 15:01:19,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 15:01:19,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 15:01:19,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 15:01:19,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 15:01:19,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 15:01:19,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 15:01:19,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 15:01:19,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 15:01:19,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 15:01:19,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 15:01:19,724 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 15:01:19,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 15:01:19,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 15:01:19,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 15:01:19,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 15:01:19,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 15:01:19,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 15:01:19,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 15:01:19,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 15:01:19,726 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 15:01:19,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 15:01:19,727 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 15:01:19,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 15:01:19,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 15:01:19,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 15:01:19,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 15:01:19,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:01:19,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 15:01:19,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 15:01:19,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 15:01:19,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 15:01:19,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 15:01:19,729 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 15:01:19,729 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 15:01:19,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 15:01:19,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 [2022-07-22 15:01:19,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 15:01:19,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 15:01:19,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 15:01:19,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 15:01:19,956 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 15:01:19,957 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-07-22 15:01:20,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48fc03f0/c3d9fe287cac4519b8fd3e9391238999/FLAGe236e02b4 [2022-07-22 15:01:20,468 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 15:01:20,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-07-22 15:01:20,479 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48fc03f0/c3d9fe287cac4519b8fd3e9391238999/FLAGe236e02b4 [2022-07-22 15:01:20,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48fc03f0/c3d9fe287cac4519b8fd3e9391238999 [2022-07-22 15:01:20,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 15:01:20,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 15:01:20,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 15:01:20,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 15:01:20,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 15:01:20,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3724d154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20, skipping insertion in model container [2022-07-22 15:01:20,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 15:01:20,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 15:01:20,836 WARN L230 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-ext3-properties/dll_nullified-2.i[23974,23987] [2022-07-22 15:01:20,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:01:20,850 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 15:01:20,885 WARN L230 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-ext3-properties/dll_nullified-2.i[23974,23987] [2022-07-22 15:01:20,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 15:01:20,907 INFO L208 MainTranslator]: Completed translation [2022-07-22 15:01:20,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20 WrapperNode [2022-07-22 15:01:20,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 15:01:20,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 15:01:20,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 15:01:20,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 15:01:20,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,952 INFO L137 Inliner]: procedures = 122, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2022-07-22 15:01:20,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 15:01:20,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 15:01:20,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 15:01:20,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 15:01:20,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 15:01:20,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 15:01:20,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 15:01:20,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 15:01:20,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (1/1) ... [2022-07-22 15:01:20,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 15:01:21,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:21,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 15:01:21,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 15:01:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 15:01:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 15:01:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 15:01:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 15:01:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 15:01:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 15:01:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 15:01:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 15:01:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 15:01:21,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 15:01:21,113 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 15:01:21,114 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 15:01:21,316 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 15:01:21,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 15:01:21,322 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-22 15:01:21,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:01:21 BoogieIcfgContainer [2022-07-22 15:01:21,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 15:01:21,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 15:01:21,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 15:01:21,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 15:01:21,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 03:01:20" (1/3) ... [2022-07-22 15:01:21,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b058d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:01:21, skipping insertion in model container [2022-07-22 15:01:21,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:01:20" (2/3) ... [2022-07-22 15:01:21,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b058d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 03:01:21, skipping insertion in model container [2022-07-22 15:01:21,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:01:21" (3/3) ... [2022-07-22 15:01:21,332 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2022-07-22 15:01:21,343 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 15:01:21,344 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 15:01:21,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 15:01:21,386 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c338169, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f055b50 [2022-07-22 15:01:21,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 15:01:21,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 15:01:21,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:21,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:21,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -91270904, now seen corresponding path program 1 times [2022-07-22 15:01:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:21,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267273089] [2022-07-22 15:01:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:21,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:21,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267273089] [2022-07-22 15:01:21,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267273089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:01:21,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:01:21,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:01:21,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831136463] [2022-07-22 15:01:21,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:01:21,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:01:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:21,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:01:21,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:01:21,636 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:21,671 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2022-07-22 15:01:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:01:21,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 15:01:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:21,680 INFO L225 Difference]: With dead ends: 52 [2022-07-22 15:01:21,680 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 15:01:21,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:01:21,685 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:21,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:21,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 15:01:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-22 15:01:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-07-22 15:01:21,709 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-07-22 15:01:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:21,709 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-07-22 15:01:21,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-07-22 15:01:21,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 15:01:21,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:21,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:21,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 15:01:21,711 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:21,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1034399597, now seen corresponding path program 1 times [2022-07-22 15:01:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:21,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193299730] [2022-07-22 15:01:21,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:21,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:21,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:21,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193299730] [2022-07-22 15:01:21,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193299730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:01:21,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:01:21,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 15:01:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964265063] [2022-07-22 15:01:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:01:21,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 15:01:21,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 15:01:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:01:21,808 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:21,857 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-22 15:01:21,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 15:01:21,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-22 15:01:21,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:21,859 INFO L225 Difference]: With dead ends: 47 [2022-07-22 15:01:21,860 INFO L226 Difference]: Without dead ends: 27 [2022-07-22 15:01:21,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 15:01:21,862 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:21,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-22 15:01:21,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-22 15:01:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-22 15:01:21,871 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-07-22 15:01:21,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:21,873 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-22 15:01:21,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-22 15:01:21,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 15:01:21,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:21,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:21,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 15:01:21,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:21,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash -776234159, now seen corresponding path program 1 times [2022-07-22 15:01:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182056392] [2022-07-22 15:01:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:21,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:21,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182056392] [2022-07-22 15:01:21,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182056392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 15:01:21,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 15:01:21,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 15:01:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346809242] [2022-07-22 15:01:21,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 15:01:21,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 15:01:21,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 15:01:21,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 15:01:21,982 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:22,263 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2022-07-22 15:01:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 15:01:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-22 15:01:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:22,265 INFO L225 Difference]: With dead ends: 71 [2022-07-22 15:01:22,265 INFO L226 Difference]: Without dead ends: 58 [2022-07-22 15:01:22,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 15:01:22,266 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 125 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:22,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 109 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 15:01:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-22 15:01:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2022-07-22 15:01:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-22 15:01:22,273 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 17 [2022-07-22 15:01:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:22,273 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-22 15:01:22,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:22,274 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-07-22 15:01:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 15:01:22,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:22,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:22,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 15:01:22,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:22,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash -774387117, now seen corresponding path program 1 times [2022-07-22 15:01:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:22,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535670113] [2022-07-22 15:01:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:22,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:22,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535670113] [2022-07-22 15:01:22,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535670113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:22,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147045720] [2022-07-22 15:01:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:22,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:22,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:22,347 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) [2022-07-22 15:01:22,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 15:01:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:22,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 15:01:22,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:22,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:22,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147045720] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:22,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:22,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-22 15:01:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953592654] [2022-07-22 15:01:22,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:22,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 15:01:22,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:22,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 15:01:22,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 15:01:22,562 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:22,592 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2022-07-22 15:01:22,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 15:01:22,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-22 15:01:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:22,594 INFO L225 Difference]: With dead ends: 69 [2022-07-22 15:01:22,594 INFO L226 Difference]: Without dead ends: 49 [2022-07-22 15:01:22,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 15:01:22,596 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:22,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 62 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-22 15:01:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-22 15:01:22,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-07-22 15:01:22,603 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 17 [2022-07-22 15:01:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:22,603 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-07-22 15:01:22,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:22,603 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-07-22 15:01:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-22 15:01:22,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:22,604 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:22,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:22,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:22,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash -459646902, now seen corresponding path program 1 times [2022-07-22 15:01:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:22,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970099164] [2022-07-22 15:01:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:23,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:23,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970099164] [2022-07-22 15:01:23,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970099164] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:23,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308434858] [2022-07-22 15:01:23,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:23,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:23,019 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) [2022-07-22 15:01:23,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 15:01:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:23,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 15:01:23,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:23,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 15:01:23,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308434858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:23,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:23,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-07-22 15:01:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191272695] [2022-07-22 15:01:23,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:23,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 15:01:23,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:23,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 15:01:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 15:01:23,299 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:23,325 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-07-22 15:01:23,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 15:01:23,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-22 15:01:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:23,329 INFO L225 Difference]: With dead ends: 72 [2022-07-22 15:01:23,330 INFO L226 Difference]: Without dead ends: 52 [2022-07-22 15:01:23,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 15:01:23,332 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:23,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 88 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 15:01:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-22 15:01:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-22 15:01:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-07-22 15:01:23,347 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 32 [2022-07-22 15:01:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:23,347 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-07-22 15:01:23,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-07-22 15:01:23,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 15:01:23,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:23,349 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:23,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:23,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:23,572 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:23,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:23,572 INFO L85 PathProgramCache]: Analyzing trace with hash -910589295, now seen corresponding path program 2 times [2022-07-22 15:01:23,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:23,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417086459] [2022-07-22 15:01:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:23,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 15:01:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:23,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417086459] [2022-07-22 15:01:23,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417086459] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:23,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261188802] [2022-07-22 15:01:23,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 15:01:23,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:23,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:23,765 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) [2022-07-22 15:01:23,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 15:01:23,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 15:01:23,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:01:23,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-22 15:01:23,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:24,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:24,035 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:01:24,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 15:01:24,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:24,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-07-22 15:01:24,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-07-22 15:01:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 15:01:24,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:24,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_694 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_694) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-22 15:01:24,354 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:24,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2022-07-22 15:01:24,370 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-22 15:01:24,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2022-07-22 15:01:24,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-07-22 15:01:24,417 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-07-22 15:01:24,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261188802] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:24,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:24,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-07-22 15:01:24,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225114231] [2022-07-22 15:01:24,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:24,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-22 15:01:24,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:24,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 15:01:24,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2022-07-22 15:01:24,421 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:25,174 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2022-07-22 15:01:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 15:01:25,175 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-22 15:01:25,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:25,175 INFO L225 Difference]: With dead ends: 86 [2022-07-22 15:01:25,175 INFO L226 Difference]: Without dead ends: 73 [2022-07-22 15:01:25,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=805, Unknown=2, NotChecked=62, Total=1122 [2022-07-22 15:01:25,176 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 356 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:25,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 103 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 202 Invalid, 0 Unknown, 68 Unchecked, 0.4s Time] [2022-07-22 15:01:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-22 15:01:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-22 15:01:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-07-22 15:01:25,182 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 37 [2022-07-22 15:01:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:25,182 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-07-22 15:01:25,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-07-22 15:01:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 15:01:25,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:25,183 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:25,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:25,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:25,383 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash -908742253, now seen corresponding path program 1 times [2022-07-22 15:01:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:25,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288769237] [2022-07-22 15:01:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 15:01:25,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:25,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288769237] [2022-07-22 15:01:25,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288769237] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:25,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890168265] [2022-07-22 15:01:25,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:25,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:25,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:25,631 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) [2022-07-22 15:01:25,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 15:01:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:25,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 15:01:25,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:25,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:25,850 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:01:25,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 15:01:25,937 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-22 15:01:25,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 31 treesize of output 44 [2022-07-22 15:01:25,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-22 15:01:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 15:01:26,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:26,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-22 15:01:26,133 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:26,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2022-07-22 15:01:26,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-07-22 15:01:26,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890168265] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:26,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:26,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-07-22 15:01:26,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126822253] [2022-07-22 15:01:26,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:26,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 15:01:26,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:26,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 15:01:26,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2022-07-22 15:01:26,178 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:26,721 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-07-22 15:01:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 15:01:26,722 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-22 15:01:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:26,723 INFO L225 Difference]: With dead ends: 76 [2022-07-22 15:01:26,723 INFO L226 Difference]: Without dead ends: 63 [2022-07-22 15:01:26,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=726, Unknown=1, NotChecked=58, Total=992 [2022-07-22 15:01:26,724 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 197 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:26,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 122 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 237 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-22 15:01:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-22 15:01:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-07-22 15:01:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:26,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-07-22 15:01:26,729 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 37 [2022-07-22 15:01:26,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:26,729 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-07-22 15:01:26,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-07-22 15:01:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-22 15:01:26,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:26,730 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:26,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:26,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:26,931 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:26,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:26,932 INFO L85 PathProgramCache]: Analyzing trace with hash -908740331, now seen corresponding path program 1 times [2022-07-22 15:01:26,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:26,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118986665] [2022-07-22 15:01:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:26,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 28 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-22 15:01:27,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:27,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118986665] [2022-07-22 15:01:27,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118986665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:27,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131434991] [2022-07-22 15:01:27,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:27,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:27,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:27,101 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) [2022-07-22 15:01:27,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 15:01:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:27,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-22 15:01:27,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:27,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:27,347 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:01:27,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 15:01:27,403 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-22 15:01:27,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 case distinctions, treesize of input 31 treesize of output 44 [2022-07-22 15:01:27,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-22 15:01:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 15:01:27,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:27,500 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1348 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1348) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2022-07-22 15:01:27,551 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:27,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2022-07-22 15:01:27,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-07-22 15:01:27,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131434991] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:27,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:27,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-07-22 15:01:27,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179646181] [2022-07-22 15:01:27,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:27,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-22 15:01:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:27,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-22 15:01:27,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2022-07-22 15:01:27,587 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:28,013 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-07-22 15:01:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 15:01:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-22 15:01:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:28,015 INFO L225 Difference]: With dead ends: 65 [2022-07-22 15:01:28,015 INFO L226 Difference]: Without dead ends: 63 [2022-07-22 15:01:28,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=634, Unknown=1, NotChecked=54, Total=870 [2022-07-22 15:01:28,016 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 298 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:28,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 124 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 189 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-07-22 15:01:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-22 15:01:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-07-22 15:01:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-07-22 15:01:28,026 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 37 [2022-07-22 15:01:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:28,026 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-07-22 15:01:28,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-07-22 15:01:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-22 15:01:28,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:28,028 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:28,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:28,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:28,229 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash 829738032, now seen corresponding path program 1 times [2022-07-22 15:01:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:28,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070400679] [2022-07-22 15:01:28,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:28,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 15:01:28,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:28,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070400679] [2022-07-22 15:01:28,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070400679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:28,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608150605] [2022-07-22 15:01:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:28,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:28,410 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) [2022-07-22 15:01:28,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 15:01:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:28,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-22 15:01:28,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:28,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:28,674 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 15:01:28,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 15:01:28,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:28,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 15:01:28,742 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:01:28,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 34 [2022-07-22 15:01:28,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 12 [2022-07-22 15:01:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-22 15:01:28,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:28,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0))) is different from false [2022-07-22 15:01:28,933 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:28,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-22 15:01:28,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 27 [2022-07-22 15:01:28,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-07-22 15:01:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-07-22 15:01:29,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608150605] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:29,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:29,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-22 15:01:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659820858] [2022-07-22 15:01:29,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:29,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-22 15:01:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-22 15:01:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=634, Unknown=1, NotChecked=50, Total=756 [2022-07-22 15:01:29,059 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:29,793 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-07-22 15:01:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 15:01:29,794 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-22 15:01:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:29,794 INFO L225 Difference]: With dead ends: 94 [2022-07-22 15:01:29,794 INFO L226 Difference]: Without dead ends: 56 [2022-07-22 15:01:29,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1214, Unknown=1, NotChecked=74, Total=1560 [2022-07-22 15:01:29,796 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 374 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:29,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 117 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 249 Invalid, 0 Unknown, 62 Unchecked, 0.4s Time] [2022-07-22 15:01:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-22 15:01:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-07-22 15:01:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-22 15:01:29,809 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 38 [2022-07-22 15:01:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:29,809 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-22 15:01:29,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-22 15:01:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 15:01:29,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:29,810 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:29,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:30,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:30,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:30,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:30,020 INFO L85 PathProgramCache]: Analyzing trace with hash 731872996, now seen corresponding path program 1 times [2022-07-22 15:01:30,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:30,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253228079] [2022-07-22 15:01:30,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:30,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 37 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 15:01:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:30,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253228079] [2022-07-22 15:01:30,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253228079] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:30,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385440251] [2022-07-22 15:01:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:30,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:30,436 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) [2022-07-22 15:01:30,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 15:01:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:30,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-22 15:01:30,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:30,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:30,684 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 15:01:30,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:30,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-07-22 15:01:30,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-22 15:01:30,860 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-22 15:01:30,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-22 15:01:30,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-22 15:01:30,904 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:01:30,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 15:01:30,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 [2022-07-22 15:01:30,972 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:01:30,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 74 [2022-07-22 15:01:30,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:30,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 38 [2022-07-22 15:01:30,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-22 15:01:31,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 15 [2022-07-22 15:01:31,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2022-07-22 15:01:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 15:01:31,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:31,278 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2013 Int) (v_ArrVal_2012 (Array Int Int)) (v_ArrVal_2010 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2010) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2012) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) 0)) is different from false [2022-07-22 15:01:31,297 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:31,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 77 [2022-07-22 15:01:31,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 124 treesize of output 112 [2022-07-22 15:01:31,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 51 [2022-07-22 15:01:31,321 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:31,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 86 [2022-07-22 15:01:31,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 136 treesize of output 118 [2022-07-22 15:01:31,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 109 treesize of output 101 [2022-07-22 15:01:31,403 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse5 (not .cse6))) (and (or (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) v_arrayElimCell_34) v_arrayElimCell_36) 0) (= (select .cse1 v_arrayElimCell_36) 0))))) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) (let ((.cse2 (select (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse3) v_arrayElimCell_34))) (or (= (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse2 v_arrayElimCell_36) 0) (= (select .cse3 v_arrayElimCell_36) 0))))))) .cse5) (or .cse6 (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0))) (forall ((v_ArrVal_2007 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (forall ((v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse8 (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) (let ((.cse7 (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) v_arrayElimCell_34))) (or (= (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse7 v_arrayElimCell_36) 0) (= (select .cse8 v_arrayElimCell_36) 0)))))))) (forall ((v_ArrVal_2007 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (forall ((v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) (or (= (select (select (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse11) v_arrayElimCell_34) v_arrayElimCell_36) 0) (= (select .cse11 v_arrayElimCell_36) 0))))))) (or (and (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (= (select (select (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) v_arrayElimCell_34) v_arrayElimCell_36) 0)) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse13 (select (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) v_arrayElimCell_34))) (or (= (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse13 v_arrayElimCell_36) 0))))) .cse5)))) is different from false [2022-07-22 15:01:31,524 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-22 15:01:31,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 52 treesize of output 61 [2022-07-22 15:01:31,583 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-22 15:01:31,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 37 treesize of output 51 [2022-07-22 15:01:31,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:31,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-22 15:01:31,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:31,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-22 15:01:32,028 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:32,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 258 treesize of output 138 [2022-07-22 15:01:32,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:32,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:32,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2807 treesize of output 2641 [2022-07-22 15:01:32,105 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:32,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 621 treesize of output 585 [2022-07-22 15:01:32,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:32,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 555 treesize of output 547 [2022-07-22 15:01:32,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-22 15:01:32,390 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:32,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 362 treesize of output 362 [2022-07-22 15:01:32,601 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-22 15:01:32,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385440251] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:32,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:32,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 42 [2022-07-22 15:01:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915156350] [2022-07-22 15:01:32,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:32,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-22 15:01:32,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:32,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-22 15:01:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1404, Unknown=6, NotChecked=154, Total=1722 [2022-07-22 15:01:32,603 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:33,639 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-07-22 15:01:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 15:01:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-22 15:01:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:33,641 INFO L225 Difference]: With dead ends: 75 [2022-07-22 15:01:33,641 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 15:01:33,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=292, Invalid=2160, Unknown=6, NotChecked=194, Total=2652 [2022-07-22 15:01:33,643 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 112 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:33,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 235 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 396 Invalid, 0 Unknown, 208 Unchecked, 0.5s Time] [2022-07-22 15:01:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 15:01:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-22 15:01:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-22 15:01:33,658 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2022-07-22 15:01:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:33,658 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-22 15:01:33,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 42 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-22 15:01:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 15:01:33,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:33,662 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:33,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:33,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:33,875 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:33,876 INFO L85 PathProgramCache]: Analyzing trace with hash 733720038, now seen corresponding path program 1 times [2022-07-22 15:01:33,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:33,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66276204] [2022-07-22 15:01:33,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:33,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 15:01:34,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:34,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66276204] [2022-07-22 15:01:34,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66276204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:34,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057297304] [2022-07-22 15:01:34,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:34,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:34,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:34,233 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) [2022-07-22 15:01:34,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 15:01:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:34,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-22 15:01:34,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:34,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:34,496 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 15:01:34,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:34,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-07-22 15:01:34,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-22 15:01:34,649 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-22 15:01:34,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-22 15:01:34,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-22 15:01:34,694 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:01:34,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 15:01:34,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 [2022-07-22 15:01:34,751 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:01:34,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 81 [2022-07-22 15:01:34,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:34,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 38 [2022-07-22 15:01:34,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 31 [2022-07-22 15:01:35,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:35,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 22 [2022-07-22 15:01:35,030 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:01:35,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-07-22 15:01:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 15:01:35,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:35,338 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2353 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2357)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (+ 8 .cse1)) 0) (= .cse1 0))))) (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2353 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (= .cse2 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2357)) .cse2) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) 0)))))) is different from false [2022-07-22 15:01:35,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:35,356 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:35,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 79 [2022-07-22 15:01:35,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:35,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 120 [2022-07-22 15:01:35,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 53 [2022-07-22 15:01:35,384 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:35,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 102 [2022-07-22 15:01:35,394 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:01:35,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 149 [2022-07-22 15:01:35,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 116 [2022-07-22 15:01:35,627 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:35,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 91 [2022-07-22 15:01:35,634 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:01:35,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 139 [2022-07-22 15:01:35,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 61 [2022-07-22 15:01:35,656 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:35,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-07-22 15:01:35,664 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:01:35,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 130 [2022-07-22 15:01:35,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 117 treesize of output 109 [2022-07-22 15:01:37,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:37,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 15:01:37,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:37,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 15:01:37,478 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:37,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 15:01:37,501 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)))) (and (or (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (forall ((v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))) (or .cse0 (forall ((v_arrayElimCell_73 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimCell_70 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_17) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0)))) (or .cse0 (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_64 Int) (v_arrayElimCell_67 Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_16) v_arrayElimCell_64) (+ 8 v_arrayElimCell_67))) (= v_arrayElimCell_67 0)))) (or (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))) (or .cse0 (forall ((v_arrayElimCell_73 Int) (v_arrayElimCell_70 Int) (v_arrayElimArr_18 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_18) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0))))) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) is different from false [2022-07-22 15:01:37,545 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (and (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (forall ((v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_64 Int) (v_arrayElimCell_67 Int)) (or (= v_arrayElimCell_67 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_16) v_arrayElimCell_64) (+ 8 v_arrayElimCell_67)) 0))) .cse0) (or (forall ((v_arrayElimCell_73 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimCell_70 Int)) (or (= v_arrayElimCell_70 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_17) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0))) .cse0) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0) (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (forall ((v_arrayElimCell_73 Int) (v_arrayElimCell_70 Int) (v_arrayElimArr_18 (Array Int Int))) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_18) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73))) (= v_arrayElimCell_70 0))) .cse0))))) is different from false [2022-07-22 15:01:37,787 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:37,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-07-22 15:01:37,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2022-07-22 15:01:37,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:37,851 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:37,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-07-22 15:01:37,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:37,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 70 treesize of output 73 [2022-07-22 15:01:37,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 54 treesize of output 46 [2022-07-22 15:01:37,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 20 [2022-07-22 15:01:37,960 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:37,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-07-22 15:01:37,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 24 [2022-07-22 15:01:37,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-07-22 15:01:37,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:37,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:38,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:38,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-07-22 15:01:38,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:38,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2022-07-22 15:01:38,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 11 refuted. 1 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-22 15:01:38,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057297304] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:38,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:38,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-07-22 15:01:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296154844] [2022-07-22 15:01:38,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:38,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-22 15:01:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:38,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-22 15:01:38,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1721, Unknown=6, NotChecked=258, Total=2162 [2022-07-22 15:01:38,280 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 47 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:41,331 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse1 (not (= .cse2 0)))) (and .cse0 (or .cse0 (forall ((v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))) (or .cse1 (forall ((v_arrayElimCell_73 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimCell_70 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_17) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0)))) (or .cse1 (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_64 Int) (v_arrayElimCell_67 Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_16) v_arrayElimCell_64) (+ 8 v_arrayElimCell_67))) (= v_arrayElimCell_67 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_27| Int)) (and (not (= |v_ULTIMATE.start_dll_create_~head~0#1.base_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_27|) 1))) (= .cse2 1) (or (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))) (or .cse1 (forall ((v_arrayElimCell_73 Int) (v_arrayElimCell_70 Int) (v_arrayElimArr_18 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_18) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0))))) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-07-22 15:01:41,616 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse2 (select .cse3 .cse7)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12)) (.cse1 (not (= .cse6 0))) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and .cse0 (or .cse0 (forall ((v_ArrVal_2345 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))) (or .cse1 (forall ((v_arrayElimCell_73 Int) (v_arrayElimArr_17 (Array Int Int)) (v_arrayElimCell_70 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_17) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0)))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_int| (select .cse3 4)) 8) 0) (or .cse1 (forall ((v_arrayElimArr_16 (Array Int Int)) (v_arrayElimCell_64 Int) (v_arrayElimCell_67 Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_16) v_arrayElimCell_64) (+ 8 v_arrayElimCell_67))) (= v_arrayElimCell_67 0)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (= 0 (select .cse3 .cse4)) (= (select .cse5 4) 0) (= (select (select |c_#memory_int| .cse2) 8) 0) (= (select .cse5 .cse4) 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_27| Int)) (and (not (= |v_ULTIMATE.start_dll_create_~head~0#1.base_27| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~head~0#1.base_27|) 1))) (= .cse6 1) (or (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26|) 0)) (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_2345 (Array Int Int))) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_26| v_ArrVal_2345) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)))) (or .cse1 (forall ((v_arrayElimCell_73 Int) (v_arrayElimCell_70 Int) (v_arrayElimArr_18 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_arrayElimArr_18) v_arrayElimCell_70) (+ 8 v_arrayElimCell_73)) 0) (= v_arrayElimCell_70 0))))) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse5 .cse7) 0)))) is different from false [2022-07-22 15:01:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:42,384 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-07-22 15:01:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 15:01:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 47 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-22 15:01:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:42,385 INFO L225 Difference]: With dead ends: 75 [2022-07-22 15:01:42,385 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 15:01:42,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=356, Invalid=2734, Unknown=10, NotChecked=560, Total=3660 [2022-07-22 15:01:42,387 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 176 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:42,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 246 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 468 Invalid, 0 Unknown, 283 Unchecked, 0.7s Time] [2022-07-22 15:01:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 15:01:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-07-22 15:01:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-07-22 15:01:42,394 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-07-22 15:01:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:42,394 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-07-22 15:01:42,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 47 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-07-22 15:01:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-22 15:01:42,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:42,395 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:42,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 15:01:42,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-22 15:01:42,608 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:42,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 733721960, now seen corresponding path program 1 times [2022-07-22 15:01:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:42,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974664482] [2022-07-22 15:01:42,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 15:01:42,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974664482] [2022-07-22 15:01:42,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974664482] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:42,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512439078] [2022-07-22 15:01:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:42,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:42,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:42,988 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) [2022-07-22 15:01:42,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 15:01:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:43,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-22 15:01:43,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:43,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:43,266 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 15:01:43,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:43,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-07-22 15:01:43,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-07-22 15:01:43,429 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-22 15:01:43,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-22 15:01:43,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-22 15:01:43,470 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:01:43,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 15:01:43,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 [2022-07-22 15:01:43,517 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:01:43,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 79 treesize of output 74 [2022-07-22 15:01:43,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:43,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 38 [2022-07-22 15:01:43,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-22 15:01:43,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-07-22 15:01:43,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 15 [2022-07-22 15:01:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 15:01:43,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:43,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2694 Int) (v_ArrVal_2697 (Array Int Int)) (v_ArrVal_2695 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2695) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2697) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) 0)) is different from false [2022-07-22 15:01:43,860 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:43,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 79 [2022-07-22 15:01:43,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 116 [2022-07-22 15:01:43,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 53 [2022-07-22 15:01:43,882 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:43,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-07-22 15:01:43,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 144 treesize of output 126 [2022-07-22 15:01:43,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 117 treesize of output 109 [2022-07-22 15:01:43,999 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse10 (not .cse0))) (and (or .cse0 (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (= (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0) (= (select (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694)) v_arrayElimCell_98) (+ 16 v_arrayElimCell_100)) 0)))))) (or .cse0 (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) (.cse5 (select (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694)) v_arrayElimCell_98))) (or (= (select .cse3 .cse4) 0) (= (select .cse5 .cse4) 0) (= (select .cse5 (+ 16 v_arrayElimCell_100)) 0))))))) (or (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse7 (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694)) (.cse8 (+ 16 v_arrayElimCell_100))) (or (= (select .cse7 .cse8) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse7) v_arrayElimCell_98) .cse8) 0))))) .cse10) (or (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0)) .cse0) (or (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse11 (select (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694))) v_arrayElimCell_98))) (or (= (select .cse11 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0) (= (select .cse11 (+ 16 v_arrayElimCell_100)) 0)))) .cse10) (or (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (= (select (select (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694))) v_arrayElimCell_98) (+ 16 v_arrayElimCell_100)) 0)) .cse10) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse15 (store .cse14 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694)) (.cse16 (+ 16 v_arrayElimCell_100))) (or (= (select .cse14 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0) (= (select .cse15 .cse16) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse15) v_arrayElimCell_98) .cse16) 0)))))) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse21 (store .cse18 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694))) (let ((.cse19 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) (.cse20 (select (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse21) v_arrayElimCell_98)) (.cse22 (+ 16 v_arrayElimCell_100))) (or (= (select .cse18 .cse19) 0) (= (select .cse20 .cse19) 0) (= (select .cse21 .cse22) 0) (= (select .cse20 .cse22) 0))))))) (or .cse10 (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_100 Int) (v_arrayElimCell_98 Int)) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse25 (store (select .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694))) (let ((.cse24 (select (store .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse25) v_arrayElimCell_98)) (.cse26 (+ 16 v_arrayElimCell_100))) (or (= (select .cse24 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0) (= (select .cse25 .cse26) 0) (= (select .cse24 .cse26) 0)))))))))) is different from false [2022-07-22 15:01:44,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:44,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 35 treesize of output 33 [2022-07-22 15:01:44,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:44,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 15:01:44,131 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-22 15:01:44,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 62 treesize of output 71 [2022-07-22 15:01:44,235 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-22 15:01:44,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 45 treesize of output 59 [2022-07-22 15:01:44,720 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:44,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 179 treesize of output 115 [2022-07-22 15:01:44,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:44,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:44,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 708 treesize of output 686 [2022-07-22 15:01:44,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:44,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 464 treesize of output 428 [2022-07-22 15:01:44,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 390 treesize of output 374 [2022-07-22 15:01:44,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-07-22 15:01:44,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:44,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 204 [2022-07-22 15:01:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-22 15:01:44,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512439078] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:44,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:44,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 41 [2022-07-22 15:01:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980106079] [2022-07-22 15:01:44,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:44,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-22 15:01:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-22 15:01:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1330, Unknown=6, NotChecked=150, Total=1640 [2022-07-22 15:01:44,999 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:01:45,832 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-07-22 15:01:45,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 15:01:45,840 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-22 15:01:45,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:01:45,840 INFO L225 Difference]: With dead ends: 64 [2022-07-22 15:01:45,840 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 15:01:45,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=300, Invalid=2152, Unknown=6, NotChecked=194, Total=2652 [2022-07-22 15:01:45,843 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 112 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:01:45,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 206 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 257 Invalid, 0 Unknown, 204 Unchecked, 0.3s Time] [2022-07-22 15:01:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 15:01:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-07-22 15:01:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:45,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-22 15:01:45,853 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 43 [2022-07-22 15:01:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:01:45,854 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-22 15:01:45,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:01:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-22 15:01:45,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 15:01:45,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:01:45,855 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:01:45,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 15:01:46,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:46,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:01:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:01:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 206461501, now seen corresponding path program 1 times [2022-07-22 15:01:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:01:46,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385173748] [2022-07-22 15:01:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:01:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 15:01:46,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:01:46,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385173748] [2022-07-22 15:01:46,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385173748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:01:46,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549867492] [2022-07-22 15:01:46,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:01:46,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:01:46,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:01:46,410 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) [2022-07-22 15:01:46,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 15:01:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:01:46,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-22 15:01:46,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:01:46,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:46,704 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 15:01:46,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:01:46,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-07-22 15:01:46,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-22 15:01:46,853 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-22 15:01:46,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-22 15:01:46,886 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:01:46,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 15:01:46,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 [2022-07-22 15:01:46,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-22 15:01:46,964 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:01:46,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 81 [2022-07-22 15:01:46,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:46,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 38 [2022-07-22 15:01:46,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 31 [2022-07-22 15:01:47,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:01:47,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2022-07-22 15:01:47,192 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:01:47,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-07-22 15:01:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 15:01:47,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:01:47,457 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3040 Int) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3038 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3036) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3040)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) .cse1) 0) (= .cse1 0))))) (forall ((v_ArrVal_3040 Int) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3038 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (= .cse2 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3040)) .cse2) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3036) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) 0)))))) is different from false [2022-07-22 15:01:47,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:47,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:47,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 77 [2022-07-22 15:01:47,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:47,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 116 [2022-07-22 15:01:47,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 51 [2022-07-22 15:01:47,499 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:47,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 98 [2022-07-22 15:01:47,503 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:01:47,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 141 [2022-07-22 15:01:47,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 120 treesize of output 108 [2022-07-22 15:01:47,722 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:47,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 89 [2022-07-22 15:01:47,728 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:01:47,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 135 [2022-07-22 15:01:47,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 59 [2022-07-22 15:01:47,776 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:01:47,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 86 [2022-07-22 15:01:47,784 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 15:01:47,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 122 [2022-07-22 15:01:47,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 109 treesize of output 101 [2022-07-22 15:01:51,140 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-22 15:01:51,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2022-07-22 15:01:51,220 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-22 15:01:51,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2022-07-22 15:01:51,274 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-22 15:01:51,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 36 treesize of output 38 [2022-07-22 15:01:51,734 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-22 15:01:51,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 109 [2022-07-22 15:01:51,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:51,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 634 treesize of output 612 [2022-07-22 15:01:51,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:51,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 376 [2022-07-22 15:01:51,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 346 treesize of output 338 [2022-07-22 15:01:51,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2022-07-22 15:01:51,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:51,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 184 [2022-07-22 15:01:51,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:51,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 212 treesize of output 120 [2022-07-22 15:01:51,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:01:51,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:51,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4360 treesize of output 4172 [2022-07-22 15:01:52,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:52,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 2448 treesize of output 2294 [2022-07-22 15:01:52,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:52,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 2283 treesize of output 2227 [2022-07-22 15:01:52,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-22 15:01:59,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:01:59,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 862 treesize of output 850 [2022-07-22 15:01:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-07-22 15:01:59,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549867492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:01:59,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:01:59,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 43 [2022-07-22 15:01:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905718109] [2022-07-22 15:01:59,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:01:59,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-22 15:01:59,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:01:59,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-22 15:01:59,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1558, Unknown=4, NotChecked=80, Total=1806 [2022-07-22 15:01:59,426 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 43 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:02:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:02:00,654 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-07-22 15:02:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 15:02:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-22 15:02:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:02:00,655 INFO L225 Difference]: With dead ends: 69 [2022-07-22 15:02:00,655 INFO L226 Difference]: Without dead ends: 62 [2022-07-22 15:02:00,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=417, Invalid=3233, Unknown=14, NotChecked=118, Total=3782 [2022-07-22 15:02:00,656 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 102 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 15:02:00,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 248 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 251 Invalid, 0 Unknown, 290 Unchecked, 0.3s Time] [2022-07-22 15:02:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-22 15:02:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-07-22 15:02:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:02:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-07-22 15:02:00,662 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 44 [2022-07-22 15:02:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:02:00,663 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-07-22 15:02:00,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.186046511627907) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:02:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-07-22 15:02:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 15:02:00,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:02:00,664 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:02:00,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 15:02:00,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-22 15:02:00,871 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:02:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:02:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash 208308543, now seen corresponding path program 1 times [2022-07-22 15:02:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:02:00,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786496021] [2022-07-22 15:02:00,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:02:00,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:02:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:02:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 15:02:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:02:01,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786496021] [2022-07-22 15:02:01,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786496021] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:02:01,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411714312] [2022-07-22 15:02:01,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:02:01,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:02:01,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:02:01,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:02:01,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 15:02:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:02:01,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-22 15:02:01,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:02:01,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:02:01,586 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 15:02:01,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:02:01,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:01,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 15:02:01,658 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:02:01,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-07-22 15:02:01,721 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-22 15:02:01,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-07-22 15:02:01,762 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 15:02:01,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-22 15:02:01,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:01,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 21 [2022-07-22 15:02:01,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 29 [2022-07-22 15:02:01,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:01,825 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-22 15:02:01,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 102 treesize of output 57 [2022-07-22 15:02:01,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-22 15:02:01,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 [2022-07-22 15:02:02,037 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-22 15:02:02,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 23 [2022-07-22 15:02:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-22 15:02:02,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:02:02,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3375 (Array Int Int)) (v_ArrVal_3376 Int)) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3376)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3375) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 4))) 0))) is different from false [2022-07-22 15:02:02,205 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-22 15:02:02,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 112 treesize of output 89 [2022-07-22 15:02:02,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:02,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:02,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 78 [2022-07-22 15:02:02,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 127 treesize of output 115 [2022-07-22 15:02:02,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 106 [2022-07-22 15:02:02,331 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-22 15:02:02,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 67 treesize of output 72 [2022-07-22 15:02:02,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:02,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-22 15:02:02,540 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-22 15:02:02,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 81 [2022-07-22 15:02:02,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:02,551 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:02,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 643 treesize of output 563 [2022-07-22 15:02:02,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:02,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 563 treesize of output 371 [2022-07-22 15:02:02,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 174 treesize of output 158 [2022-07-22 15:02:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-07-22 15:02:02,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411714312] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 15:02:02,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 15:02:02,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 46 [2022-07-22 15:02:02,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576355650] [2022-07-22 15:02:02,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 15:02:02,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-22 15:02:02,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 15:02:02,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-22 15:02:02,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1830, Unknown=14, NotChecked=86, Total=2070 [2022-07-22 15:02:02,794 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:02:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 15:02:04,948 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-07-22 15:02:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 15:02:04,949 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-22 15:02:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 15:02:04,949 INFO L225 Difference]: With dead ends: 64 [2022-07-22 15:02:04,949 INFO L226 Difference]: Without dead ends: 55 [2022-07-22 15:02:04,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=533, Invalid=3363, Unknown=14, NotChecked=122, Total=4032 [2022-07-22 15:02:04,950 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 230 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 15:02:04,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 514 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 575 Invalid, 0 Unknown, 230 Unchecked, 0.8s Time] [2022-07-22 15:02:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-22 15:02:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-22 15:02:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:02:04,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-07-22 15:02:04,957 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 44 [2022-07-22 15:02:04,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 15:02:04,957 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-07-22 15:02:04,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 46 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 15:02:04,958 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-07-22 15:02:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-22 15:02:04,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 15:02:04,958 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 15:02:04,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 15:02:05,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-22 15:02:05,159 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 15:02:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 15:02:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1765953289, now seen corresponding path program 2 times [2022-07-22 15:02:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 15:02:05,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794401000] [2022-07-22 15:02:05,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 15:02:05,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 15:02:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 15:02:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 38 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 15:02:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 15:02:05,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794401000] [2022-07-22 15:02:05,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794401000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 15:02:05,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085984428] [2022-07-22 15:02:05,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 15:02:05,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 15:02:05,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 15:02:05,776 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 15:02:05,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 15:02:06,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 15:02:06,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 15:02:06,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-22 15:02:06,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 15:02:06,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:02:06,079 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-22 15:02:06,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-22 15:02:06,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-07-22 15:02:06,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-07-22 15:02:06,281 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-22 15:02:06,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-22 15:02:06,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 [2022-07-22 15:02:06,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 21 [2022-07-22 15:02:06,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 [2022-07-22 15:02:06,446 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 15:02:06,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2022-07-22 15:02:06,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2022-07-22 15:02:06,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-07-22 15:02:06,576 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-22 15:02:06,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 29 [2022-07-22 15:02:06,633 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-22 15:02:06,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 16 treesize of output 21 [2022-07-22 15:02:06,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-22 15:02:06,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 16 treesize of output 21 [2022-07-22 15:02:06,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2022-07-22 15:02:06,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 41 [2022-07-22 15:02:06,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:06,721 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-22 15:02:06,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 166 treesize of output 93 [2022-07-22 15:02:06,731 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-22 15:02:06,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 75 treesize of output 62 [2022-07-22 15:02:06,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 37 [2022-07-22 15:02:07,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:07,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:07,158 INFO L356 Elim1Store]: treesize reduction 51, result has 5.6 percent of original size [2022-07-22 15:02:07,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 61 [2022-07-22 15:02:07,167 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 15:02:07,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2022-07-22 15:02:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 15:02:07,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 15:02:07,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3738 Int) (v_ArrVal_3735 (Array Int Int))) (= (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 v_ArrVal_3738))) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3735) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) 0)) is different from false [2022-07-22 15:02:07,410 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-22 15:02:07,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 265 treesize of output 222 [2022-07-22 15:02:07,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:07,418 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:07,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 205 treesize of output 162 [2022-07-22 15:02:07,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_3738 Int) (v_arrayElimArr_46 (Array Int Int)) (v_arrayElimArr_47 (Array Int Int)) (v_ArrVal_3730 (Array Int Int)) (v_ArrVal_3735 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_46 .cse0))) (not (= (select v_arrayElimArr_47 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_46))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3738)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_47))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3730) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3735) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) 0)))) is different from false [2022-07-22 15:02:07,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (v_ArrVal_3715 Int) (v_ArrVal_3738 Int) (v_ArrVal_3719 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_39| Int) (v_arrayElimArr_47 (Array Int Int)) (v_ArrVal_3730 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| Int) (v_ArrVal_3735 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_39| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) 0)) (= 0 (let ((.cse6 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse3 (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3719) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_arrayElimArr_46))) (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_3738)))) (.cse0 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3717) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_arrayElimArr_47))) (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|))))) (let ((.cse1 (select (select .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) .cse4)) (.cse2 (+ (select (select .cse3 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) .cse4) 4))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3715)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_ArrVal_3730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3735) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) (not (= (select v_arrayElimArr_47 .cse4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select v_arrayElimArr_46 .cse4) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) is different from false [2022-07-22 15:02:07,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:07,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:07,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 377 treesize of output 308 [2022-07-22 15:02:07,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:07,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 15:02:07,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 287 treesize of output 218 [2022-07-22 15:02:07,794 INFO L356 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-07-22 15:02:07,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155616 treesize of output 151874 [2022-07-22 15:02:07,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:08,274 INFO L356 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2022-07-22 15:02:08,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 10263424 treesize of output 9953551 [2022-07-22 15:02:16,309 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3867 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 15:02:24,072 WARN L233 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 3863 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 15:02:24,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:24,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 15:02:24,955 INFO L356 Elim1Store]: treesize reduction 109, result has 61.2 percent of original size [2022-07-22 15:02:24,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 11027646 treesize of output 10692011 [2022-07-22 15:02:34,178 WARN L233 SmtUtils]: Spent 9.21s on a formula simplification that was a NOOP. DAG size: 3988 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 15:02:43,319 WARN L233 SmtUtils]: Spent 9.13s on a formula simplification that was a NOOP. DAG size: 3983 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 15:02:43,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 15:02:44,202 INFO L356 Elim1Store]: treesize reduction 109, result has 61.2 percent of original size [2022-07-22 15:02:44,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 13372386 treesize of output 12281857