./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 eb692b52 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-?-eb692b5 [2022-07-19 14:47:59,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:47:59,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:47:59,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:47:59,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:47:59,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:47:59,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:47:59,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:47:59,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:47:59,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:47:59,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:47:59,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:47:59,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:47:59,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:47:59,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:47:59,974 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:47:59,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:47:59,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:47:59,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:47:59,980 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:47:59,983 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:47:59,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:47:59,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:47:59,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:47:59,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:47:59,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:47:59,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:47:59,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:47:59,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:47:59,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:47:59,992 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:47:59,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:47:59,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:47:59,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:47:59,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:47:59,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:47:59,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:47:59,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:47:59,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:47:59,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:47:59,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:47:59,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:48:00,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:48:00,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:48:00,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:48:00,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:48:00,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:48:00,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:48:00,031 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:48:00,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:48:00,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:48:00,032 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:48:00,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:48:00,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:48:00,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:48:00,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:48:00,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:48:00,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:48:00,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:48:00,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:48:00,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:48:00,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:48:00,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:48:00,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:48:00,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:48:00,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:48:00,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:48:00,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:48:00,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:48:00,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:48:00,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:48:00,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:48:00,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:48:00,037 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:48:00,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:48:00,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:48:00,037 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-19 14:48:00,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:48:00,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:48:00,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:48:00,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:48:00,239 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:48:00,239 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-19 14:48:00,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca89c9af/9419d22a70334a3586ae9466a985c7d5/FLAGeeafaefd8 [2022-07-19 14:48:00,642 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:48:00,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-07-19 14:48:00,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca89c9af/9419d22a70334a3586ae9466a985c7d5/FLAGeeafaefd8 [2022-07-19 14:48:01,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca89c9af/9419d22a70334a3586ae9466a985c7d5 [2022-07-19 14:48:01,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:48:01,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:48:01,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:48:01,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:48:01,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:48:01,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64dbaaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01, skipping insertion in model container [2022-07-19 14:48:01,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:48:01,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:48:01,282 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-19 14:48:01,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:48:01,294 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:48:01,322 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-19 14:48:01,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:48:01,339 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:48:01,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01 WrapperNode [2022-07-19 14:48:01,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:48:01,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:48:01,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:48:01,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:48:01,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,371 INFO L137 Inliner]: procedures = 122, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2022-07-19 14:48:01,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:48:01,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:48:01,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:48:01,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:48:01,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:48:01,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:48:01,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:48:01,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:48:01,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (1/1) ... [2022-07-19 14:48:01,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:48:01,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:01,435 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-19 14:48:01,450 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-19 14:48:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:48:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:48:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:48:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:48:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:48:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:48:01,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:48:01,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:48:01,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:48:01,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:48:01,544 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:48:01,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:48:01,687 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:48:01,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:48:01,692 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 14:48:01,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:48:01 BoogieIcfgContainer [2022-07-19 14:48:01,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:48:01,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:48:01,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:48:01,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:48:01,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:48:01" (1/3) ... [2022-07-19 14:48:01,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58244687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:48:01, skipping insertion in model container [2022-07-19 14:48:01,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:48:01" (2/3) ... [2022-07-19 14:48:01,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58244687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:48:01, skipping insertion in model container [2022-07-19 14:48:01,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:48:01" (3/3) ... [2022-07-19 14:48:01,699 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2022-07-19 14:48:01,711 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:48:01,712 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:48:01,746 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:48:01,754 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@51fc3bf6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e8406ba [2022-07-19 14:48:01,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:48:01,763 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-19 14:48:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:48:01,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:01,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:01,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:01,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash -91270904, now seen corresponding path program 1 times [2022-07-19 14:48:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:01,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889332159] [2022-07-19 14:48:01,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:01,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:01,899 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-19 14:48:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:01,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889332159] [2022-07-19 14:48:01,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889332159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:48:01,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:48:01,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:48:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388623886] [2022-07-19 14:48:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:48:01,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:48:01,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:01,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:48:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:48:01,936 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-19 14:48:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:01,971 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2022-07-19 14:48:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:48:01,973 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-19 14:48:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:01,978 INFO L225 Difference]: With dead ends: 52 [2022-07-19 14:48:01,978 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 14:48:01,980 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-19 14:48:01,983 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-19 14:48:01,983 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-19 14:48:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 14:48:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-19 14:48:02,013 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-19 14:48:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-07-19 14:48:02,015 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-07-19 14:48:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:02,015 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-07-19 14:48:02,015 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-19 14:48:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-07-19 14:48:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:48:02,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:02,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:02,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:48:02,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1034399597, now seen corresponding path program 1 times [2022-07-19 14:48:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:02,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726909327] [2022-07-19 14:48:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:02,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:02,089 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-19 14:48:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:02,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726909327] [2022-07-19 14:48:02,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726909327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:48:02,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:48:02,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:48:02,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5284723] [2022-07-19 14:48:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:48:02,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:48:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:48:02,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:48:02,094 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-19 14:48:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:02,129 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-19 14:48:02,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:48:02,130 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-19 14:48:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:02,131 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:48:02,132 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 14:48:02,135 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-19 14:48:02,136 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-19 14:48:02,137 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-19 14:48:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 14:48:02,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-19 14:48:02,143 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-19 14:48:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-19 14:48:02,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-07-19 14:48:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:02,148 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-19 14:48:02,148 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-19 14:48:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-19 14:48:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:48:02,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:02,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:48:02,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -776234159, now seen corresponding path program 1 times [2022-07-19 14:48:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:02,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078552677] [2022-07-19 14:48:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:02,241 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-19 14:48:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:02,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078552677] [2022-07-19 14:48:02,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078552677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:48:02,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:48:02,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 14:48:02,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054079687] [2022-07-19 14:48:02,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:48:02,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:48:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:48:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:48:02,243 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-19 14:48:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:02,455 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2022-07-19 14:48:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:48:02,455 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-19 14:48:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:02,456 INFO L225 Difference]: With dead ends: 71 [2022-07-19 14:48:02,456 INFO L226 Difference]: Without dead ends: 58 [2022-07-19 14:48:02,457 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-19 14:48:02,457 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 125 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 14:48:02,458 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-19 14:48:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-19 14:48:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2022-07-19 14:48:02,461 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-19 14:48:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-19 14:48:02,462 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 17 [2022-07-19 14:48:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:02,462 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-19 14:48:02,463 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-19 14:48:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-07-19 14:48:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:48:02,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:02,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:48:02,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:48:02,464 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:02,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash -774387117, now seen corresponding path program 1 times [2022-07-19 14:48:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:02,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141341733] [2022-07-19 14:48:02,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:02,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:02,534 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-19 14:48:02,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:02,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141341733] [2022-07-19 14:48:02,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141341733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:02,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387797569] [2022-07-19 14:48:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:02,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:02,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:02,548 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-19 14:48:02,551 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-19 14:48:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:02,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 14:48:02,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:02,684 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-19 14:48:02,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:02,714 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-19 14:48:02,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387797569] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:02,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:02,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-19 14:48:02,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354044187] [2022-07-19 14:48:02,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:02,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:48:02,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:48:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-19 14:48:02,716 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-19 14:48:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:02,739 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2022-07-19 14:48:02,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:48:02,755 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-19 14:48:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:02,758 INFO L225 Difference]: With dead ends: 69 [2022-07-19 14:48:02,758 INFO L226 Difference]: Without dead ends: 49 [2022-07-19 14:48:02,758 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-19 14:48:02,759 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-19 14:48:02,759 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-19 14:48:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-19 14:48:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-19 14:48:02,763 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-19 14:48:02,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-07-19 14:48:02,764 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 17 [2022-07-19 14:48:02,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:02,764 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-07-19 14:48:02,764 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-19 14:48:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-07-19 14:48:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 14:48:02,765 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:02,765 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-19 14:48:02,787 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-19 14:48:02,979 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-19 14:48:02,980 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash -459646902, now seen corresponding path program 1 times [2022-07-19 14:48:02,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:02,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769346232] [2022-07-19 14:48:02,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:03,145 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-19 14:48:03,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:03,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769346232] [2022-07-19 14:48:03,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769346232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:03,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027841550] [2022-07-19 14:48:03,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:03,147 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-19 14:48:03,149 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-19 14:48:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:03,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 14:48:03,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:03,327 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-19 14:48:03,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:03,371 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-19 14:48:03,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027841550] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:03,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:03,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-07-19 14:48:03,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258339671] [2022-07-19 14:48:03,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:03,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 14:48:03,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:03,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 14:48:03,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-19 14:48:03,374 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-19 14:48:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:03,396 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-07-19 14:48:03,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 14:48:03,396 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-19 14:48:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:03,400 INFO L225 Difference]: With dead ends: 72 [2022-07-19 14:48:03,400 INFO L226 Difference]: Without dead ends: 52 [2022-07-19 14:48:03,400 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-19 14:48:03,402 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-19 14:48:03,403 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-19 14:48:03,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-19 14:48:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-19 14:48:03,413 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-19 14:48:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-07-19 14:48:03,415 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 32 [2022-07-19 14:48:03,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:03,415 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-07-19 14:48:03,415 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-19 14:48:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-07-19 14:48:03,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:48:03,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:03,416 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-19 14:48:03,436 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-19 14:48:03,619 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-19 14:48:03,620 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:03,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:03,620 INFO L85 PathProgramCache]: Analyzing trace with hash -910589295, now seen corresponding path program 2 times [2022-07-19 14:48:03,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:03,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015316693] [2022-07-19 14:48:03,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:03,761 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-19 14:48:03,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:03,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015316693] [2022-07-19 14:48:03,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015316693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:03,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442186969] [2022-07-19 14:48:03,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:48:03,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:03,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:03,763 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-19 14:48:03,764 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-19 14:48:03,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:48:03,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:48:03,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-19 14:48:03,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:03,942 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-19 14:48:03,965 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:48:03,966 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-19 14:48:03,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:03,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:03,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:03,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:03,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:04,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:04,008 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-19 14:48:04,050 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-19 14:48:04,126 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-19 14:48:04,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:04,142 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-19 14:48:04,199 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:48:04,199 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-19 14:48:04,205 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-19 14:48:04,205 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-19 14:48:04,208 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-19 14:48:04,234 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-19 14:48:04,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442186969] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:04,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:04,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-07-19 14:48:04,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080341517] [2022-07-19 14:48:04,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:04,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 14:48:04,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:04,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 14:48:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2022-07-19 14:48:04,236 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-19 14:48:04,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:04,860 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2022-07-19 14:48:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 14:48:04,860 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-19 14:48:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:04,861 INFO L225 Difference]: With dead ends: 86 [2022-07-19 14:48:04,861 INFO L226 Difference]: Without dead ends: 73 [2022-07-19 14:48:04,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=805, Unknown=2, NotChecked=62, Total=1122 [2022-07-19 14:48:04,865 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 356 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:04,866 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.3s Time] [2022-07-19 14:48:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-19 14:48:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-19 14:48:04,875 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-19 14:48:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-07-19 14:48:04,878 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 37 [2022-07-19 14:48:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:04,878 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-07-19 14:48:04,878 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-19 14:48:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-07-19 14:48:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:48:04,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:04,880 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-19 14:48:04,900 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-19 14:48:05,095 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-19 14:48:05,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:05,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash -908742253, now seen corresponding path program 1 times [2022-07-19 14:48:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:05,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005469238] [2022-07-19 14:48:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:05,284 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-19 14:48:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:05,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005469238] [2022-07-19 14:48:05,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005469238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:05,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856357245] [2022-07-19 14:48:05,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:05,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:05,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:05,286 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-19 14:48:05,289 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-19 14:48:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:05,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-19 14:48:05,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:05,448 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-19 14:48:05,465 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:48:05,465 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-19 14:48:05,518 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-19 14:48:05,518 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-19 14:48:05,545 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-19 14:48:05,607 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-19 14:48:05,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:05,645 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-19 14:48:05,686 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:48:05,686 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-19 14:48:05,690 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-19 14:48:05,716 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-19 14:48:05,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856357245] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:05,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:05,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-07-19 14:48:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457388673] [2022-07-19 14:48:05,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:05,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 14:48:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:05,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 14:48:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2022-07-19 14:48:05,718 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-19 14:48:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:06,153 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-07-19 14:48:06,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:48:06,155 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-19 14:48:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:06,155 INFO L225 Difference]: With dead ends: 76 [2022-07-19 14:48:06,155 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 14:48:06,156 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-19 14:48:06,156 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 197 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 14:48:06,157 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-19 14:48:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 14:48:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-07-19 14:48:06,159 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-19 14:48:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-07-19 14:48:06,160 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 37 [2022-07-19 14:48:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:06,160 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-07-19 14:48:06,160 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-19 14:48:06,160 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-07-19 14:48:06,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:48:06,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:06,160 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-19 14:48:06,182 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-19 14:48:06,371 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-19 14:48:06,371 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -908740331, now seen corresponding path program 1 times [2022-07-19 14:48:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:06,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583032339] [2022-07-19 14:48:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:06,526 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-19 14:48:06,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:06,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583032339] [2022-07-19 14:48:06,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583032339] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:06,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142127349] [2022-07-19 14:48:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:06,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:06,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:06,528 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-19 14:48:06,529 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-19 14:48:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:06,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 14:48:06,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:06,713 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-19 14:48:06,724 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:48:06,725 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-19 14:48:06,771 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-19 14:48:06,772 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-19 14:48:06,791 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-19 14:48:06,841 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-19 14:48:06,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:06,861 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-19 14:48:06,910 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:48:06,910 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-19 14:48:06,913 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-19 14:48:06,940 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-19 14:48:06,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142127349] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:06,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:06,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-07-19 14:48:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030674990] [2022-07-19 14:48:06,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:06,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-19 14:48:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:06,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-19 14:48:06,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2022-07-19 14:48:06,942 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-19 14:48:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:07,301 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-07-19 14:48:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 14:48:07,302 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-19 14:48:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:07,302 INFO L225 Difference]: With dead ends: 65 [2022-07-19 14:48:07,302 INFO L226 Difference]: Without dead ends: 63 [2022-07-19 14:48:07,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=634, Unknown=1, NotChecked=54, Total=870 [2022-07-19 14:48:07,303 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-19 14:48:07,303 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-19 14:48:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-19 14:48:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-07-19 14:48:07,306 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-19 14:48:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-07-19 14:48:07,306 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 37 [2022-07-19 14:48:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:07,307 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-07-19 14:48:07,307 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-19 14:48:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-07-19 14:48:07,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 14:48:07,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:07,307 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-19 14:48:07,331 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-19 14:48:07,514 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-19 14:48:07,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:07,515 INFO L85 PathProgramCache]: Analyzing trace with hash 829738032, now seen corresponding path program 1 times [2022-07-19 14:48:07,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:07,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356002199] [2022-07-19 14:48:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:07,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:07,651 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-19 14:48:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:07,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356002199] [2022-07-19 14:48:07,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356002199] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:07,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945099906] [2022-07-19 14:48:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:07,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:07,664 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-19 14:48:07,665 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-19 14:48:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:07,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-19 14:48:07,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:07,839 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-19 14:48:07,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:48:07,871 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-19 14:48:07,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:07,895 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-19 14:48:07,921 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:48:07,921 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-19 14:48:08,001 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-19 14:48:08,013 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-19 14:48:08,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:08,082 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-19 14:48:08,094 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:48:08,094 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-19 14:48:08,096 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-19 14:48:08,100 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-19 14:48:08,189 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-19 14:48:08,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945099906] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:08,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:08,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-19 14:48:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584590626] [2022-07-19 14:48:08,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:08,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 14:48:08,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 14:48:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=634, Unknown=1, NotChecked=50, Total=756 [2022-07-19 14:48:08,190 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-19 14:48:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:08,879 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-07-19 14:48:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 14:48:08,879 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-19 14:48:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:08,880 INFO L225 Difference]: With dead ends: 94 [2022-07-19 14:48:08,880 INFO L226 Difference]: Without dead ends: 56 [2022-07-19 14:48:08,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1214, Unknown=1, NotChecked=74, Total=1560 [2022-07-19 14:48:08,881 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 374 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-19 14:48:08,881 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-19 14:48:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-19 14:48:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-07-19 14:48:08,884 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-19 14:48:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-19 14:48:08,885 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 38 [2022-07-19 14:48:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:08,885 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-19 14:48:08,885 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-19 14:48:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-19 14:48:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 14:48:08,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:08,886 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-19 14:48:08,906 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-19 14:48:09,099 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-19 14:48:09,099 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:09,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash 731872996, now seen corresponding path program 1 times [2022-07-19 14:48:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:09,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162442348] [2022-07-19 14:48:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:09,421 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-19 14:48:09,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:09,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162442348] [2022-07-19 14:48:09,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162442348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:09,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472291160] [2022-07-19 14:48:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:09,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:09,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:09,423 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-19 14:48:09,424 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-19 14:48:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:09,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-19 14:48:09,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:09,634 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-19 14:48:09,654 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:48:09,655 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-19 14:48:09,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,693 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-19 14:48:09,724 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-19 14:48:09,819 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:48:09,820 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-19 14:48:09,846 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-19 14:48:09,854 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:48:09,854 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-19 14:48:09,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,859 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-19 14:48:09,898 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:48:09,899 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-19 14:48:09,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:09,904 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-19 14:48:09,906 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-19 14:48:10,030 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-19 14:48:10,039 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-19 14:48:10,064 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-19 14:48:10,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:10,176 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-19 14:48:10,193 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:48:10,193 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-19 14:48:10,196 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-19 14:48:10,200 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-19 14:48:10,211 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:48:10,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, 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-19 14:48:10,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 136 treesize of output 118 [2022-07-19 14:48:10,218 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-19 14:48:10,307 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (not .cse0) (= (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0)) (and .cse0 (= (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_2013)) v_arrayElimCell_34) v_arrayElimCell_36) 0)))))) is different from false [2022-07-19 14:48:10,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:10,364 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-19 14:48:11,111 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:48:11,111 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 131 treesize of output 95 [2022-07-19 14:48:11,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:11,134 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 1482 treesize of output 1458 [2022-07-19 14:48:11,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:11,161 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 1842 treesize of output 1742 [2022-07-19 14:48:11,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:11,187 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 1790 treesize of output 1768 [2022-07-19 14:48:46,961 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-19 14:48:46,973 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 30 treesize of output 26 [2022-07-19 14:48:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 7 refuted. 2 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-19 14:48:47,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472291160] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:47,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:47,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 42 [2022-07-19 14:48:47,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581506874] [2022-07-19 14:48:47,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:47,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-19 14:48:47,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:47,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-19 14:48:47,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1405, Unknown=7, NotChecked=154, Total=1722 [2022-07-19 14:48:47,078 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-19 14:48:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:47,720 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-07-19 14:48:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:48:47,720 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-19 14:48:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:47,721 INFO L225 Difference]: With dead ends: 75 [2022-07-19 14:48:47,721 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 14:48:47,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=290, Invalid=2161, Unknown=7, NotChecked=194, Total=2652 [2022-07-19 14:48:47,722 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 110 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:47,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 257 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 369 Invalid, 0 Unknown, 260 Unchecked, 0.3s Time] [2022-07-19 14:48:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 14:48:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-19 14:48:47,726 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-19 14:48:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-19 14:48:47,727 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2022-07-19 14:48:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:47,727 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-19 14:48:47,727 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-19 14:48:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-19 14:48:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 14:48:47,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:47,728 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-19 14:48:47,747 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-19 14:48:47,947 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-19 14:48:47,947 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash 733720038, now seen corresponding path program 1 times [2022-07-19 14:48:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:47,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842503040] [2022-07-19 14:48:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:48,223 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-19 14:48:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:48,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842503040] [2022-07-19 14:48:48,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842503040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:48,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966781555] [2022-07-19 14:48:48,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:48,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:48,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:48,225 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-19 14:48:48,226 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-19 14:48:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:48,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-19 14:48:48,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:48,449 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-19 14:48:48,467 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:48:48,468 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-19 14:48:48,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,523 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-19 14:48:48,550 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-19 14:48:48,620 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:48:48,621 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-19 14:48:48,646 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-19 14:48:48,656 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:48:48,657 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-19 14:48:48,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,669 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-19 14:48:48,705 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:48:48,705 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-19 14:48:48,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,709 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-19 14:48:48,714 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-19 14:48:48,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:48,932 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-19 14:48:48,935 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:48:48,935 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-19 14:48:48,972 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-19 14:48:48,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:49,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2353 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (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|) .cse2)) (.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|) .cse2))) (or (and (= .cse0 0) (= .cse1 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)) .cse0) (+ 8 .cse1)) 0))))) is different from false [2022-07-19 14:48:49,190 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:48:49,190 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 129 treesize of output 119 [2022-07-19 14:48:49,201 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:48:49,201 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 192 treesize of output 168 [2022-07-19 14:48:49,213 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 106 treesize of output 98 [2022-07-19 14:48:49,225 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:48:49,226 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 144 treesize of output 119 [2022-07-19 14:48:49,231 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:48:49,232 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 197 treesize of output 167 [2022-07-19 14:48:49,234 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 154 treesize of output 142 [2022-07-19 14:48:53,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_61 Int) (v_ArrVal_2345 (Array Int Int)) (v_ArrVal_2357 Int) (v_arrayElimCell_64 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2345)) (.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse0)) (.cse2 (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (or (and .cse0 (= v_arrayElimCell_64 0)) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse1)) (or (and .cse0 (= v_arrayElimCell_61 0)) (and .cse1 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (and .cse1 (= (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) 0)) (and .cse0 (= (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2357)) v_arrayElimCell_61) (+ 8 v_arrayElimCell_64)) 0)))))) is different from false [2022-07-19 14:48:55,328 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-19 14:48:55,329 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 25 treesize of output 32 [2022-07-19 14:48:55,450 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-19 14:48:55,450 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 25 treesize of output 32 [2022-07-19 14:48:55,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:55,464 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-19 14:48:56,314 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:48:56,315 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-19 14:48:56,324 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:56,324 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 140 treesize of output 137 [2022-07-19 14:48:56,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 59 treesize of output 51 [2022-07-19 14:48:56,332 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 94 [2022-07-19 14:48:56,421 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:48:56,421 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 135 treesize of output 99 [2022-07-19 14:48:56,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,433 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-19 14:48:56,436 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-19 14:48:56,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:56,458 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 135 treesize of output 99 [2022-07-19 14:48:56,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:48:56,472 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-19 14:48:56,475 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-19 14:48:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 9 refuted. 3 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-19 14:48:56,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966781555] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:56,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:56,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-07-19 14:48:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38509385] [2022-07-19 14:48:56,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:56,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-19 14:48:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-19 14:48:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1800, Unknown=8, NotChecked=174, Total=2162 [2022-07-19 14:48:56,636 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-19 14:48:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:48:57,871 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-07-19 14:48:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 14:48:57,871 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-19 14:48:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:48:57,872 INFO L225 Difference]: With dead ends: 75 [2022-07-19 14:48:57,872 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 14:48:57,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=334, Invalid=2858, Unknown=8, NotChecked=222, Total=3422 [2022-07-19 14:48:57,873 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 100 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 270 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 14:48:57,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 308 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 560 Invalid, 0 Unknown, 270 Unchecked, 0.7s Time] [2022-07-19 14:48:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 14:48:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-07-19 14:48:57,877 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-19 14:48:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-07-19 14:48:57,877 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-07-19 14:48:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:48:57,878 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-07-19 14:48:57,878 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-19 14:48:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-07-19 14:48:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 14:48:57,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:48:57,878 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-19 14:48:57,899 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-19 14:48:58,096 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-19 14:48:58,096 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:48:58,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:48:58,096 INFO L85 PathProgramCache]: Analyzing trace with hash 733721960, now seen corresponding path program 1 times [2022-07-19 14:48:58,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:48:58,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762326743] [2022-07-19 14:48:58,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:58,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:48:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:58,343 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-19 14:48:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:48:58,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762326743] [2022-07-19 14:48:58,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762326743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:48:58,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723064095] [2022-07-19 14:48:58,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:48:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:48:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:48:58,345 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-19 14:48:58,345 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-19 14:48:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:48:58,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-19 14:48:58,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:48:58,558 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-19 14:48:58,575 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:48:58,575 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-19 14:48:58,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,610 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-19 14:48:58,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 16 treesize of output 18 [2022-07-19 14:48:58,692 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:48:58,692 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-19 14:48:58,713 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-19 14:48:58,722 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:48:58,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, 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-19 14:48:58,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,726 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-19 14:48:58,755 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:48:58,755 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-19 14:48:58,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:48:58,758 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-19 14:48:58,761 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-19 14:48:58,866 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-19 14:48:58,870 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-19 14:48:58,890 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-19 14:48:58,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:48:58,993 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-19 14:48:59,005 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:48:59,006 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-19 14:48:59,008 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-19 14:48:59,012 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-19 14:48:59,024 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:48:59,025 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-19 14:48:59,027 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-19 14:48:59,029 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-19 14:48:59,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2694 Int) (v_arrayElimCell_90 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_88 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse0 (= (select (select (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694)) v_arrayElimCell_88) (+ 16 v_arrayElimCell_90)) 0)) (and (= (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0) (not .cse0)))))) is different from false [2022-07-19 14:48:59,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:48:59,200 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-19 14:48:59,409 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:48:59,409 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-19 14:48:59,412 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 140 treesize of output 122 [2022-07-19 14:48:59,415 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 102 treesize of output 94 [2022-07-19 14:48:59,416 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 94 treesize of output 78 [2022-07-19 14:48:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 10 refuted. 2 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-19 14:48:59,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723064095] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:48:59,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:48:59,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 41 [2022-07-19 14:48:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879189808] [2022-07-19 14:48:59,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:48:59,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-19 14:48:59,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:48:59,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-19 14:48:59,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1330, Unknown=8, NotChecked=150, Total=1640 [2022-07-19 14:48:59,539 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-19 14:49:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:00,442 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-07-19 14:49:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 14:49:00,442 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-19 14:49:00,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:00,443 INFO L225 Difference]: With dead ends: 64 [2022-07-19 14:49:00,443 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 14:49:00,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=337, Invalid=2314, Unknown=9, NotChecked=202, Total=2862 [2022-07-19 14:49:00,444 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 419 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:00,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 267 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 421 Invalid, 0 Unknown, 419 Unchecked, 0.5s Time] [2022-07-19 14:49:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 14:49:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-07-19 14:49:00,448 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-19 14:49:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-19 14:49:00,448 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 43 [2022-07-19 14:49:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:00,449 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-19 14:49:00,449 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-19 14:49:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-19 14:49:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 14:49:00,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:00,450 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-19 14:49:00,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:49:00,661 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-19 14:49:00,661 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:00,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash 206461501, now seen corresponding path program 1 times [2022-07-19 14:49:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:49:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672549102] [2022-07-19 14:49:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:49:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:00,933 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-19 14:49:00,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:49:00,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672549102] [2022-07-19 14:49:00,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672549102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:49:00,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424142211] [2022-07-19 14:49:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:00,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:49:00,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:49:00,935 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-19 14:49:00,963 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-19 14:49:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:01,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-19 14:49:01,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:01,190 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-19 14:49:01,205 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:49:01,205 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-19 14:49:01,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,240 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-19 14:49:01,266 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-19 14:49:01,323 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-19 14:49:01,323 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-19 14:49:01,359 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:49:01,359 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-19 14:49:01,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,365 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-19 14:49:01,370 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-19 14:49:01,406 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:49:01,406 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-19 14:49:01,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,411 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-19 14:49:01,413 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-19 14:49:01,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:01,564 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-19 14:49:01,567 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:49:01,567 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-19 14:49:01,592 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-19 14:49:01,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:01,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3040 Int) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3038 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (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|) .cse2)) (.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|) .cse2))) (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)) .cse0) .cse1) 0) (and (= .cse0 0) (= .cse1 0)))))) is different from false [2022-07-19 14:49:01,779 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:49:01,779 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 117 [2022-07-19 14:49:01,784 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:49:01,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 188 treesize of output 164 [2022-07-19 14:49:01,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 104 treesize of output 96 [2022-07-19 14:49:01,798 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:49:01,798 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 140 treesize of output 115 [2022-07-19 14:49:01,803 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:49:01,804 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 189 treesize of output 159 [2022-07-19 14:49:01,807 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 146 treesize of output 134 [2022-07-19 14:49:04,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3040 Int) (v_arrayElimCell_110 Int) (v_arrayElimCell_113 Int) (v_ArrVal_3029 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3029)) (.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse0)) (.cse2 (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (or (and .cse0 (= v_arrayElimCell_113 0)) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse1)) (or (and .cse0 (= v_arrayElimCell_110 0)) (and .cse1 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (and (= (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) .cse1) (and .cse0 (= (select (select (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3040)) v_arrayElimCell_110) v_arrayElimCell_113) 0)))))) is different from false [2022-07-19 14:49:05,560 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-19 14:49:05,560 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 21 treesize of output 28 [2022-07-19 14:49:05,799 INFO L356 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2022-07-19 14:49:05,799 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 21 treesize of output 28 [2022-07-19 14:49:05,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:05,810 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-19 14:49:06,606 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:49:06,607 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 41 treesize of output 62 [2022-07-19 14:49:06,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:06,614 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 60 treesize of output 63 [2022-07-19 14:49:06,617 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 48 treesize of output 44 [2022-07-19 14:49:06,620 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 22 treesize of output 20 [2022-07-19 14:49:06,686 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-19 14:49:06,686 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 131 treesize of output 95 [2022-07-19 14:49:06,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,696 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 30 treesize of output 22 [2022-07-19 14:49:06,698 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-19 14:49:06,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,715 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:06,724 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 131 treesize of output 95 [2022-07-19 14:49:06,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:06,734 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 30 treesize of output 22 [2022-07-19 14:49:06,736 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 5 treesize of output 3 [2022-07-19 14:49:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 6 refuted. 2 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-19 14:49:06,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424142211] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:49:06,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:49:06,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 43 [2022-07-19 14:49:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129935087] [2022-07-19 14:49:06,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:49:06,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-19 14:49:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:49:06,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-19 14:49:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1482, Unknown=7, NotChecked=158, Total=1806 [2022-07-19 14:49:06,864 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-19 14:49:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:07,592 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-07-19 14:49:07,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 14:49:07,592 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-19 14:49:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:07,593 INFO L225 Difference]: With dead ends: 69 [2022-07-19 14:49:07,593 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 14:49:07,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=313, Invalid=2340, Unknown=7, NotChecked=202, Total=2862 [2022-07-19 14:49:07,594 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 103 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:07,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 279 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 353 Invalid, 0 Unknown, 178 Unchecked, 0.3s Time] [2022-07-19 14:49:07,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 14:49:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-07-19 14:49:07,598 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-19 14:49:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-07-19 14:49:07,598 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 44 [2022-07-19 14:49:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:07,598 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-07-19 14:49:07,598 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-19 14:49:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-07-19 14:49:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 14:49:07,599 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:07,599 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-19 14:49:07,618 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-19 14:49:07,803 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-19 14:49:07,804 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:07,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash 208308543, now seen corresponding path program 1 times [2022-07-19 14:49:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:49:07,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201586719] [2022-07-19 14:49:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:49:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:08,077 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-19 14:49:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:49:08,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201586719] [2022-07-19 14:49:08,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201586719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:49:08,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488065831] [2022-07-19 14:49:08,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:08,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:49:08,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:49:08,079 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-19 14:49:08,080 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-19 14:49:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:08,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-19 14:49:08,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:08,330 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-19 14:49:08,374 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:49:08,374 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-19 14:49:08,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:08,408 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-19 14:49:08,439 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:49:08,439 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-19 14:49:08,503 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-19 14:49:08,503 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-19 14:49:08,540 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-19 14:49:08,540 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-19 14:49:08,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:08,544 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-19 14:49:08,546 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-19 14:49:08,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:08,588 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-19 14:49:08,588 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-19 14:49:08,591 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-19 14:49:08,733 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-19 14:49:08,769 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-19 14:49:08,769 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-19 14:49:08,786 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-19 14:49:08,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:08,901 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-19 14:49:08,914 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-19 14:49:08,914 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-19 14:49:08,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:08,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:08,921 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-19 14:49:08,923 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-19 14:49:08,925 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-19 14:49:08,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_3376 Int) (v_arrayElimCell_138 Int) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_30 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_30))) (store .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3376))))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))))) (and (or .cse1 (not (= (select .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0))) (or (not .cse1) (not (= (select .cse2 (+ v_arrayElimCell_138 4)) 0)))))))) is different from false [2022-07-19 14:49:09,033 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-19 14:49:09,034 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-19 14:49:09,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:09,046 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-19 14:49:09,133 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-19 14:49:09,133 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-19 14:49:09,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:09,147 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-19 14:49:09,238 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-19 14:49:09,238 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 73 treesize of output 78 [2022-07-19 14:49:09,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:09,250 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-19 14:49:09,344 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:49:09,345 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 45 treesize of output 51 [2022-07-19 14:49:09,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:09,352 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 148 treesize of output 151 [2022-07-19 14:49:09,355 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 122 treesize of output 118 [2022-07-19 14:49:09,618 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-19 14:49:09,618 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 120 treesize of output 81 [2022-07-19 14:49:09,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:09,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:09,626 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 1919 treesize of output 1803 [2022-07-19 14:49:09,635 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 1794 treesize of output 1630 [2022-07-19 14:49:09,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:09,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 436 treesize of output 452 [2022-07-19 14:49:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-19 14:49:10,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488065831] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:49:10,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:49:10,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 46 [2022-07-19 14:49:10,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994370891] [2022-07-19 14:49:10,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:49:10,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-19 14:49:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:49:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-19 14:49:10,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1751, Unknown=11, NotChecked=170, Total=2070 [2022-07-19 14:49:10,059 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-19 14:49:10,593 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select |c_#memory_int| .cse0) 8) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_3376 Int) (v_arrayElimCell_138 Int) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_30 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_30))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3376))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))))) (and (or .cse2 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0))) (or (not .cse2) (not (= (select .cse3 (+ v_arrayElimCell_138 4)) 0)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2022-07-19 14:49:10,596 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_3376 Int) (v_arrayElimCell_138 Int) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_30 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_30))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3376))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1))))) (and (or .cse2 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0))) (or (not .cse2) (not (= (select .cse3 (+ v_arrayElimCell_138 4)) 0)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) is different from false [2022-07-19 14:49:10,827 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (let ((.cse0 (select .cse10 .cse9))) (let ((.cse1 (select .cse10 4)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select |c_#memory_int| .cse1) 8) 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 8) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse2 0)) (= (select .cse3 4) 0) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_3376 Int) (v_arrayElimCell_138 Int) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_30 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_30))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3376))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4))))) (and (or .cse5 (not (= (select .cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0))) (or (not .cse5) (not (= (select .cse6 (+ v_arrayElimCell_138 4)) 0)))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select .cse3 .cse9) 0) (not (= .cse0 .cse2)))))) is different from false [2022-07-19 14:49:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:49:11,683 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-07-19 14:49:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 14:49:11,683 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-19 14:49:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:49:11,683 INFO L225 Difference]: With dead ends: 64 [2022-07-19 14:49:11,683 INFO L226 Difference]: Without dead ends: 55 [2022-07-19 14:49:11,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=490, Invalid=3056, Unknown=14, NotChecked=600, Total=4160 [2022-07-19 14:49:11,685 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 101 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:49:11,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 487 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 463 Invalid, 0 Unknown, 220 Unchecked, 0.4s Time] [2022-07-19 14:49:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-19 14:49:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-19 14:49:11,689 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-19 14:49:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-07-19 14:49:11,689 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 44 [2022-07-19 14:49:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:49:11,689 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-07-19 14:49:11,689 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-19 14:49:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-07-19 14:49:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 14:49:11,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:49:11,690 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-19 14:49:11,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-19 14:49:11,895 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-19 14:49:11,895 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:49:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:49:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1765953289, now seen corresponding path program 2 times [2022-07-19 14:49:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:49:11,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040748261] [2022-07-19 14:49:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:49:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:49:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:49:12,449 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-19 14:49:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:49:12,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040748261] [2022-07-19 14:49:12,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040748261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:49:12,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487275039] [2022-07-19 14:49:12,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:49:12,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:49:12,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:49:12,451 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-19 14:49:12,466 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-19 14:49:12,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:49:12,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:49:12,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-19 14:49:12,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:49:12,722 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-19 14:49:12,735 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 14:49:12,736 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-19 14:49:12,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,778 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-19 14:49:12,814 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-19 14:49:12,897 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 14:49:12,898 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-19 14:49:12,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,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, 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-19 14:49:12,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 21 treesize of output 21 [2022-07-19 14:49:12,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:12,977 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-19 14:49:13,044 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:49:13,045 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-19 14:49:13,049 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-19 14:49:13,052 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-19 14:49:13,174 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-19 14:49:13,175 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-19 14:49:13,230 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 14:49:13,231 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-19 14:49:13,233 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-19 14:49:13,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:13,239 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-19 14:49:13,243 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-19 14:49:13,246 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-19 14:49:13,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:13,302 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-19 14:49:13,303 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-19 14:49:13,311 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-19 14:49:13,311 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-19 14:49:13,314 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-19 14:49:13,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:13,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:49:13,719 INFO L356 Elim1Store]: treesize reduction 51, result has 5.6 percent of original size [2022-07-19 14:49:13,719 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-19 14:49:13,726 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:49:13,726 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-19 14:49:13,762 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-19 14:49:13,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:49:13,926 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-19 14:49:13,946 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-19 14:49:13,947 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-19 14:49:13,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:13,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:13,955 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-19 14:49:13,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_3738 Int) (v_arrayElimArr_39 (Array Int Int)) (v_ArrVal_3730 (Array Int Int)) (v_arrayElimArr_40 (Array Int Int)) (v_ArrVal_3735 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (= (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse3 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_39))) (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)))) (.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_40))) (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 ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)) (.cse2 (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse4)))) (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 .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_39 .cse4))) (not (= (select v_arrayElimArr_40 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-07-19 14:49:14,182 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_39 (Array Int Int)) (v_ArrVal_3730 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| Int) (v_arrayElimArr_40 (Array Int Int)) (v_ArrVal_3735 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_40| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_40| 4))) (let ((.cse0 (select v_arrayElimArr_40 .cse5))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) 0)) (= (let ((.cse7 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (let ((.cse8 (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_39))) (store .cse8 .cse0 (store (select .cse8 .cse0) .cse7 v_ArrVal_3738)))) (.cse1 (let ((.cse6 (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_40))) (store .cse6 .cse0 (store (select .cse6 .cse0) .cse7 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|))))) (let ((.cse2 (select (select .cse1 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) .cse5)) (.cse3 (+ (select (select .cse4 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) .cse5) 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) .cse0 v_ArrVal_3735) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= (select v_arrayElimArr_39 .cse5) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) is different from false [2022-07-19 14:49:14,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:14,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:14,199 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 429 treesize of output 360 [2022-07-19 14:49:14,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:14,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:49:14,210 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 339 treesize of output 270 [2022-07-19 14:49:14,234 INFO L356 Elim1Store]: treesize reduction 44, result has 8.3 percent of original size [2022-07-19 14:49:14,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75168 treesize of output 72922 [2022-07-19 14:49:14,498 INFO L356 Elim1Store]: treesize reduction 38, result has 67.0 percent of original size [2022-07-19 14:49:14,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 3747368 treesize of output 3519551 [2022-07-19 14:49:50,113 WARN L233 SmtUtils]: Spent 35.61s on a formula simplification. DAG size of input: 2582 DAG size of output: 2576 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:49:52,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:49:53,050 INFO L356 Elim1Store]: treesize reduction 104, result has 57.6 percent of original size [2022-07-19 14:49:53,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3998635 treesize of output 3379567 [2022-07-19 14:51:14,794 WARN L233 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 2633 DAG size of output: 2598 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:51:18,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:51:18,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 5174401 treesize of output 4637467 [2022-07-19 14:51:29,636 WARN L233 SmtUtils]: Spent 11.22s on a formula simplification. DAG size of input: 2813 DAG size of output: 2812 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:51:35,076 WARN L233 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 2532 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:51:35,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:51:35,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 4571159 treesize of output 4504357 [2022-07-19 14:51:47,053 WARN L233 SmtUtils]: Spent 11.55s on a formula simplification. DAG size of input: 2746 DAG size of output: 2745 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:51:52,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:51:52,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4290740 treesize of output 4125324