./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 6c24879c 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-?-6c24879 [2022-07-12 03:39:51,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:39:51,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:39:51,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:39:51,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:39:51,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:39:51,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:39:51,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:39:51,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:39:51,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:39:51,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:39:51,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:39:51,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:39:51,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:39:51,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:39:51,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:39:51,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:39:51,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:39:51,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:39:51,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:39:51,488 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:39:51,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:39:51,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:39:51,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:39:51,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:39:51,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:39:51,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:39:51,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:39:51,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:39:51,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:39:51,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:39:51,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:39:51,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:39:51,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:39:51,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:39:51,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:39:51,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:39:51,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:39:51,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:39:51,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:39:51,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:39:51,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:39:51,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:39:51,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:39:51,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:39:51,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:39:51,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:39:51,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:39:51,533 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:39:51,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:39:51,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:39:51,533 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:39:51,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:39:51,534 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:39:51,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:39:51,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:39:51,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:39:51,535 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:39:51,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:39:51,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:39:51,536 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:39:51,536 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:39:51,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:39:51,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:39:51,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:39:51,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:39:51,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:39:51,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:39:51,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:39:51,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:39:51,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:39:51,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:39:51,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:39:51,539 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:39:51,539 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:39:51,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:39:51,539 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-12 03:39:51,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:39:51,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:39:51,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:39:51,750 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:39:51,750 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:39:51,751 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-12 03:39:51,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3eda5f1c/ad69f7b6c3594716a7197f359db84ed8/FLAGf528aaeed [2022-07-12 03:39:52,197 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:39:52,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-07-12 03:39:52,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3eda5f1c/ad69f7b6c3594716a7197f359db84ed8/FLAGf528aaeed [2022-07-12 03:39:52,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3eda5f1c/ad69f7b6c3594716a7197f359db84ed8 [2022-07-12 03:39:52,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:39:52,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:39:52,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:39:52,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:39:52,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:39:52,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:52,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea82e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52, skipping insertion in model container [2022-07-12 03:39:52,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:52,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:39:52,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:39:52,916 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-12 03:39:52,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:39:52,932 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:39:52,963 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-12 03:39:52,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:39:52,986 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:39:52,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52 WrapperNode [2022-07-12 03:39:52,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:39:52,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:39:52,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:39:52,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:39:52,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,035 INFO L137 Inliner]: procedures = 122, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2022-07-12 03:39:53,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:39:53,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:39:53,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:39:53,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:39:53,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:39:53,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:39:53,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:39:53,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:39:53,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (1/1) ... [2022-07-12 03:39:53,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:39:53,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:53,115 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-12 03:39:53,118 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-12 03:39:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:39:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:39:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:39:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:39:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:39:53,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:39:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:39:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:39:53,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:39:53,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:39:53,227 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:39:53,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:39:53,446 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:39:53,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:39:53,451 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 03:39:53,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:39:53 BoogieIcfgContainer [2022-07-12 03:39:53,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:39:53,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:39:53,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:39:53,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:39:53,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:39:52" (1/3) ... [2022-07-12 03:39:53,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a79c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:39:53, skipping insertion in model container [2022-07-12 03:39:53,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:39:52" (2/3) ... [2022-07-12 03:39:53,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a79c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:39:53, skipping insertion in model container [2022-07-12 03:39:53,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:39:53" (3/3) ... [2022-07-12 03:39:53,469 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2022-07-12 03:39:53,484 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:39:53,484 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:39:53,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:39:53,553 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@2af302b4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32c9be87 [2022-07-12 03:39:53,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:39:53,562 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-12 03:39:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:39:53,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:53,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:53,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:53,582 INFO L85 PathProgramCache]: Analyzing trace with hash -91270904, now seen corresponding path program 1 times [2022-07-12 03:39:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:53,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382237988] [2022-07-12 03:39:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:53,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:53,742 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-12 03:39:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:53,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382237988] [2022-07-12 03:39:53,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382237988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:39:53,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:39:53,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:39:53,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394363718] [2022-07-12 03:39:53,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:39:53,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:39:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:53,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:39:53,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:39:53,777 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-12 03:39:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:53,817 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2022-07-12 03:39:53,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:39:53,819 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-12 03:39:53,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:53,824 INFO L225 Difference]: With dead ends: 52 [2022-07-12 03:39:53,825 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:39:53,830 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-12 03:39:53,833 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-12 03:39:53,834 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-12 03:39:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:39:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-12 03:39:53,856 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-12 03:39:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-07-12 03:39:53,859 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-07-12 03:39:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:53,859 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-07-12 03:39:53,860 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-12 03:39:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-07-12 03:39:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:39:53,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:53,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:53,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:39:53,861 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:53,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1034399597, now seen corresponding path program 1 times [2022-07-12 03:39:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:53,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488762228] [2022-07-12 03:39:53,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:53,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:53,978 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-12 03:39:53,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:53,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488762228] [2022-07-12 03:39:53,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488762228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:39:53,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:39:53,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:39:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840531991] [2022-07-12 03:39:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:39:53,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:39:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:53,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:39:53,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:39:53,991 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-12 03:39:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:54,030 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-12 03:39:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:39:54,031 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-12 03:39:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:54,032 INFO L225 Difference]: With dead ends: 47 [2022-07-12 03:39:54,033 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:39:54,036 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-12 03:39:54,038 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-12 03:39:54,038 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-12 03:39:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:39:54,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-12 03:39:54,044 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-12 03:39:54,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-12 03:39:54,046 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-07-12 03:39:54,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:54,049 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-12 03:39:54,050 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-12 03:39:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-12 03:39:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:39:54,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:54,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:54,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:39:54,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:54,055 INFO L85 PathProgramCache]: Analyzing trace with hash -776234159, now seen corresponding path program 1 times [2022-07-12 03:39:54,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:54,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562327825] [2022-07-12 03:39:54,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:54,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:54,174 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-12 03:39:54,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:54,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562327825] [2022-07-12 03:39:54,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562327825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:39:54,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:39:54,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:39:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199417519] [2022-07-12 03:39:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:39:54,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:39:54,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:54,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:39:54,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:39:54,178 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-12 03:39:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:54,500 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2022-07-12 03:39:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:39:54,501 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-12 03:39:54,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:54,502 INFO L225 Difference]: With dead ends: 71 [2022-07-12 03:39:54,503 INFO L226 Difference]: Without dead ends: 58 [2022-07-12 03:39:54,503 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-12 03:39:54,504 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 125 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:54,505 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-12 03:39:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-12 03:39:54,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2022-07-12 03:39:54,517 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-12 03:39:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-12 03:39:54,518 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 17 [2022-07-12 03:39:54,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:54,518 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-12 03:39:54,518 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-12 03:39:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-07-12 03:39:54,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:39:54,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:54,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:54,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:39:54,519 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:54,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash -774387117, now seen corresponding path program 1 times [2022-07-12 03:39:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:54,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902550586] [2022-07-12 03:39:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:54,609 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-12 03:39:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:54,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902550586] [2022-07-12 03:39:54,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902550586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:54,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626927166] [2022-07-12 03:39:54,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:54,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:54,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:54,612 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-12 03:39:54,614 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-12 03:39:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:54,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:39:54,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:54,742 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-12 03:39:54,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:54,771 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-12 03:39:54,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626927166] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:54,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:54,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-12 03:39:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666332980] [2022-07-12 03:39:54,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:54,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:39:54,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:54,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:39:54,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:39:54,773 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-12 03:39:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:54,793 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2022-07-12 03:39:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:39:54,794 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-12 03:39:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:54,795 INFO L225 Difference]: With dead ends: 69 [2022-07-12 03:39:54,796 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 03:39:54,797 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-12 03:39:54,799 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-12 03:39:54,800 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-12 03:39:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 03:39:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-12 03:39:54,805 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-12 03:39:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-07-12 03:39:54,806 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 17 [2022-07-12 03:39:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:54,806 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-07-12 03:39:54,806 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-12 03:39:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-07-12 03:39:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:39:54,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:54,807 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-12 03:39:54,828 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-12 03:39:55,028 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-12 03:39:55,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash -459646902, now seen corresponding path program 1 times [2022-07-12 03:39:55,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:55,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440796810] [2022-07-12 03:39:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:55,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:55,194 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-12 03:39:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:55,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440796810] [2022-07-12 03:39:55,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440796810] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:55,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217854860] [2022-07-12 03:39:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:55,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:55,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:55,204 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-12 03:39:55,205 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-12 03:39:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:55,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:39:55,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:55,414 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-12 03:39:55,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:55,446 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-12 03:39:55,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217854860] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:55,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:55,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-07-12 03:39:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366938702] [2022-07-12 03:39:55,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:55,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:39:55,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:55,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:39:55,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:39:55,448 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-12 03:39:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:55,463 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-07-12 03:39:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:39:55,464 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-12 03:39:55,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:55,465 INFO L225 Difference]: With dead ends: 72 [2022-07-12 03:39:55,465 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 03:39:55,465 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-12 03:39:55,466 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-12 03:39:55,466 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-12 03:39:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 03:39:55,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-12 03:39:55,470 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-12 03:39:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-07-12 03:39:55,470 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 32 [2022-07-12 03:39:55,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:55,471 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-07-12 03:39:55,471 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-12 03:39:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-07-12 03:39:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:39:55,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:55,472 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-12 03:39:55,497 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-12 03:39:55,688 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-12 03:39:55,688 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash -910589295, now seen corresponding path program 2 times [2022-07-12 03:39:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:55,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710279439] [2022-07-12 03:39:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:55,887 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-12 03:39:55,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:55,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710279439] [2022-07-12 03:39:55,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710279439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:55,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987118227] [2022-07-12 03:39:55,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:39:55,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:55,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:55,889 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-12 03:39:55,891 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-12 03:39:56,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:39:56,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:39:56,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-12 03:39:56,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:56,143 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-12 03:39:56,170 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:56,173 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-12 03:39:56,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:56,220 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-12 03:39:56,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 23 treesize of output 23 [2022-07-12 03:39:56,378 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-12 03:39:56,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:56,399 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-12 03:39:56,469 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-12 03:39:56,469 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-12 03:39:56,476 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-12 03:39:56,477 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-12 03:39:56,480 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-12 03:39:56,513 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-12 03:39:56,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987118227] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:56,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:56,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-07-12 03:39:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575349779] [2022-07-12 03:39:56,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:56,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 03:39:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:56,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 03:39:56,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2022-07-12 03:39:56,516 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-12 03:39:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:57,146 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2022-07-12 03:39:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 03:39:57,147 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-12 03:39:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:57,148 INFO L225 Difference]: With dead ends: 86 [2022-07-12 03:39:57,148 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 03:39:57,150 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-12 03:39:57,154 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.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:57,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 103 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 202 Invalid, 0 Unknown, 68 Unchecked, 0.4s Time] [2022-07-12 03:39:57,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 03:39:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-12 03:39:57,167 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-12 03:39:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-07-12 03:39:57,168 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 37 [2022-07-12 03:39:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:57,168 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-07-12 03:39:57,168 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-12 03:39:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-07-12 03:39:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:39:57,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:57,169 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-12 03:39:57,200 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-12 03:39:57,370 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-12 03:39:57,371 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:57,371 INFO L85 PathProgramCache]: Analyzing trace with hash -908742253, now seen corresponding path program 1 times [2022-07-12 03:39:57,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:57,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435498389] [2022-07-12 03:39:57,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:57,558 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-12 03:39:57,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:57,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435498389] [2022-07-12 03:39:57,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435498389] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:57,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229015956] [2022-07-12 03:39:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:57,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:57,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:57,576 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-12 03:39:57,607 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-12 03:39:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:57,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 03:39:57,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:57,774 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-12 03:39:57,792 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:57,793 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-12 03:39:57,839 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-12 03:39:57,840 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-12 03:39:57,863 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-12 03:39:57,918 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-12 03:39:57,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:57,966 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-12 03:39:58,036 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-12 03:39:58,037 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-12 03:39:58,041 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-12 03:39:58,073 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-12 03:39:58,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229015956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:58,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:58,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-07-12 03:39:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812202102] [2022-07-12 03:39:58,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:58,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 03:39:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 03:39:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2022-07-12 03:39:58,076 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-12 03:39:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:58,543 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-07-12 03:39:58,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:39:58,543 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-12 03:39:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:58,544 INFO L225 Difference]: With dead ends: 76 [2022-07-12 03:39:58,544 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 03:39:58,544 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-12 03:39:58,545 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 197 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:58,545 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-12 03:39:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 03:39:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-07-12 03:39:58,549 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-12 03:39:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-07-12 03:39:58,549 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 37 [2022-07-12 03:39:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:58,549 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-07-12 03:39:58,549 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-12 03:39:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-07-12 03:39:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 03:39:58,550 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:58,551 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-12 03:39:58,571 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-12 03:39:58,768 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-12 03:39:58,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:58,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash -908740331, now seen corresponding path program 1 times [2022-07-12 03:39:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:58,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312329375] [2022-07-12 03:39:58,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:58,977 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-12 03:39:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:58,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312329375] [2022-07-12 03:39:58,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312329375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:58,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600203052] [2022-07-12 03:39:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:58,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:58,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:58,979 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-12 03:39:58,980 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-12 03:39:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:59,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 03:39:59,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:59,181 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-12 03:39:59,192 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:39:59,193 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-12 03:39:59,239 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-12 03:39:59,239 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-12 03:39:59,256 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-12 03:39:59,306 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-12 03:39:59,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:59,325 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-12 03:39:59,369 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-12 03:39:59,370 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-12 03:39:59,372 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-12 03:39:59,397 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-12 03:39:59,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600203052] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:59,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:59,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-07-12 03:39:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199661216] [2022-07-12 03:39:59,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:59,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 03:39:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:59,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 03:39:59,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2022-07-12 03:39:59,400 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-12 03:39:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:59,785 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-07-12 03:39:59,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:39:59,786 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-12 03:39:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:59,787 INFO L225 Difference]: With dead ends: 65 [2022-07-12 03:39:59,787 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 03:39:59,787 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-12 03:39:59,788 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-12 03:39:59,788 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-12 03:39:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 03:39:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-07-12 03:39:59,791 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-12 03:39:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-07-12 03:39:59,792 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 37 [2022-07-12 03:39:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:59,792 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-07-12 03:39:59,792 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-12 03:39:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-07-12 03:39:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:39:59,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:59,792 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-12 03:39:59,829 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-12 03:39:59,999 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-12 03:40:00,002 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash 829738032, now seen corresponding path program 1 times [2022-07-12 03:40:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:00,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089548698] [2022-07-12 03:40:00,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:00,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:00,122 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-12 03:40:00,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089548698] [2022-07-12 03:40:00,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089548698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136739168] [2022-07-12 03:40:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:00,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:00,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:00,125 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-12 03:40:00,127 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-12 03:40:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:00,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-12 03:40:00,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:00,350 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-12 03:40:00,387 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:40:00,387 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-12 03:40:00,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:00,413 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-12 03:40:00,440 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:00,441 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-12 03:40:00,513 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-12 03:40:00,526 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-12 03:40:00,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:00,599 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-12 03:40:00,616 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:00,617 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-12 03:40:00,620 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-12 03:40:00,625 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-12 03:40:00,745 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-12 03:40:00,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136739168] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:00,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:40:00,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-12 03:40:00,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221905482] [2022-07-12 03:40:00,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:00,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 03:40:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:40:00,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 03:40:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=634, Unknown=1, NotChecked=50, Total=756 [2022-07-12 03:40:00,747 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-12 03:40:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:01,508 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-07-12 03:40:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 03:40:01,509 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-12 03:40:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:01,509 INFO L225 Difference]: With dead ends: 94 [2022-07-12 03:40:01,510 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 03:40:01,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1214, Unknown=1, NotChecked=74, Total=1560 [2022-07-12 03:40:01,511 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 374 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:01,511 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-12 03:40:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 03:40:01,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-07-12 03:40:01,516 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-12 03:40:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-12 03:40:01,516 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 38 [2022-07-12 03:40:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:01,516 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-12 03:40:01,517 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-12 03:40:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-12 03:40:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:40:01,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:01,518 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-12 03:40:01,547 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-12 03:40:01,737 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-12 03:40:01,737 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash 731872996, now seen corresponding path program 1 times [2022-07-12 03:40:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:01,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844587623] [2022-07-12 03:40:01,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:01,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:02,059 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-12 03:40:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:02,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844587623] [2022-07-12 03:40:02,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844587623] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:02,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005168292] [2022-07-12 03:40:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:02,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:02,068 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-12 03:40:02,091 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-12 03:40:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:02,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 03:40:02,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:02,304 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-12 03:40:02,324 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:40:02,325 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-12 03:40:02,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,367 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-12 03:40:02,404 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-12 03:40:02,492 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:40:02,492 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-12 03:40:02,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:40:02,533 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:40:02,533 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-12 03:40:02,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,539 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-12 03:40:02,577 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:02,578 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-12 03:40:02,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:02,582 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-12 03:40:02,585 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-12 03:40:02,718 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-12 03:40:02,720 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-12 03:40:02,754 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-12 03:40:02,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:02,863 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-12 03:40:02,897 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:02,898 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-12 03:40:02,901 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-12 03:40:02,905 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-12 03:40:02,916 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:02,916 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-12 03:40:02,920 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-12 03:40:02,922 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-12 03:40:03,030 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (not .cse0))) (and (or .cse0 (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (= (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_2013)) v_arrayElimCell_34) v_arrayElimCell_36) 0) (= (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0)))))) (or .cse0 (forall ((v_ArrVal_2007 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0))) (or .cse3 (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (= (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (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_2013))) v_arrayElimCell_34) v_arrayElimCell_36) 0))) (or .cse3 (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) (or (= (select (select (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6) v_arrayElimCell_34) v_arrayElimCell_36) 0) (= (select .cse6 v_arrayElimCell_36) 0)))))) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse8 (store .cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) (let ((.cse7 (select (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) v_arrayElimCell_34))) (or (= (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse7 v_arrayElimCell_36) 0) (= (select .cse8 v_arrayElimCell_36) 0) (= (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0))))))) (or .cse3 (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse11 (select (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) v_arrayElimCell_34))) (or (= (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse11 v_arrayElimCell_36) 0))))) (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse15 (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse14 (store .cse15 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) (or (= (select (select (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse14) v_arrayElimCell_34) v_arrayElimCell_36) 0) (= (select .cse14 v_arrayElimCell_36) 0) (= (select .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0)))))) (or .cse0 (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse16 (select (store .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse17 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013)) v_arrayElimCell_34))) (or (= (select .cse16 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse16 v_arrayElimCell_36) 0) (= (select .cse17 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0))))))) (or .cse3 (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse20 (store (select .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013))) (let ((.cse19 (select (store .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse20) v_arrayElimCell_34))) (or (= (select .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0) (= (select .cse19 v_arrayElimCell_36) 0) (= (select .cse20 v_arrayElimCell_36) 0)))))))))) is different from false [2022-07-12 03:40:03,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:03,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-12 03:40:03,202 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-12 03:40:03,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2022-07-12 03:40:03,251 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-12 03:40:03,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 61 [2022-07-12 03:40:03,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:03,303 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-12 03:40:03,697 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-12 03:40:03,697 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 127 treesize of output 91 [2022-07-12 03:40:03,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:03,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:03,714 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 1503 treesize of output 1423 [2022-07-12 03:40:03,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:03,741 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 371 treesize of output 357 [2022-07-12 03:40:03,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 346 treesize of output 338 [2022-07-12 03:40:03,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:40:03,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:03,793 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 348 treesize of output 350 [2022-07-12 03:40:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-12 03:40:03,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005168292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:03,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:40:03,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 42 [2022-07-12 03:40:03,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119999891] [2022-07-12 03:40:03,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:03,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 03:40:03,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:40:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 03:40:03,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1404, Unknown=6, NotChecked=154, Total=1722 [2022-07-12 03:40:03,993 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-12 03:40:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:04,887 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-07-12 03:40:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:40:04,888 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-12 03:40:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:04,888 INFO L225 Difference]: With dead ends: 75 [2022-07-12 03:40:04,888 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:40:04,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=292, Invalid=2160, Unknown=6, NotChecked=194, Total=2652 [2022-07-12 03:40:04,889 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 110 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:04,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 235 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 369 Invalid, 0 Unknown, 204 Unchecked, 0.4s Time] [2022-07-12 03:40:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:40:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-07-12 03:40:04,925 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-12 03:40:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-12 03:40:04,926 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2022-07-12 03:40:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:04,926 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-12 03:40:04,927 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-12 03:40:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-12 03:40:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:40:04,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:04,928 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-12 03:40:04,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-12 03:40:05,130 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-12 03:40:05,131 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:05,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash 733720038, now seen corresponding path program 1 times [2022-07-12 03:40:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:05,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205506468] [2022-07-12 03:40:05,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:05,423 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-12 03:40:05,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:05,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205506468] [2022-07-12 03:40:05,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205506468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:05,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888097508] [2022-07-12 03:40:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:05,427 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-12 03:40:05,427 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-12 03:40:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:05,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-12 03:40:05,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:05,663 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-12 03:40:05,680 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:40:05,680 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-12 03:40:05,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,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, 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-12 03:40:05,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 03:40:05,847 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:40:05,847 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-12 03:40:05,883 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-12 03:40:05,892 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:40:05,893 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-12 03:40:05,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,903 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-12 03:40:05,947 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:05,947 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-12 03:40:05,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:05,952 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-12 03:40:05,957 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-12 03:40:06,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:06,225 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-12 03:40:06,239 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:40:06,239 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-12 03:40:06,279 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-12 03:40:06,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:06,520 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2353 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2357)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (+ 8 .cse1)) 0) (= .cse1 0))))) (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2357 Int) (v_ArrVal_2353 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2355) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (= .cse2 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2357)) .cse2) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2353) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) 0)))))) is different from false [2022-07-12 03:40:06,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:06,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:06,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 79 [2022-07-12 03:40:06,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:06,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 120 [2022-07-12 03:40:06,544 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-12 03:40:06,557 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:06,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 102 [2022-07-12 03:40:06,562 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:40:06,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 149 [2022-07-12 03:40:06,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-07-12 03:40:06,709 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:06,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 91 [2022-07-12 03:40:06,715 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:40:06,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 139 [2022-07-12 03:40:06,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2022-07-12 03:40:06,733 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:06,733 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-12 03:40:06,740 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:40:06,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 130 [2022-07-12 03:40:06,744 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-12 03:40:08,163 INFO L356 Elim1Store]: treesize reduction 55, result has 36.8 percent of original size [2022-07-12 03:40:08,164 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 82 [2022-07-12 03:40:08,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:08,258 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-12 03:40:08,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:08,279 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-12 03:40:08,770 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-12 03:40:08,770 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-12 03:40:08,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:08,781 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 140 treesize of output 137 [2022-07-12 03:40:08,786 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-12 03:40:08,789 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-12 03:40:08,884 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-12 03:40:08,885 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 266 treesize of output 146 [2022-07-12 03:40:08,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:08,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:08,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1857 treesize of output 1803 [2022-07-12 03:40:08,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:08,936 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 1437 treesize of output 1281 [2022-07-12 03:40:08,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:08,956 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 1243 treesize of output 1191 [2022-07-12 03:40:09,002 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-12 03:40:09,093 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:09,093 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 416 treesize of output 404 [2022-07-12 03:40:09,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,251 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,253 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:09,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 64 [2022-07-12 03:40:09,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:09,266 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-12 03:40:09,268 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-12 03:40:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 36 proven. 13 refuted. 3 times theorem prover too weak. 7 trivial. 2 not checked. [2022-07-12 03:40:09,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888097508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:09,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:40:09,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 47 [2022-07-12 03:40:09,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619723007] [2022-07-12 03:40:09,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:09,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 03:40:09,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:40:09,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 03:40:09,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1877, Unknown=14, NotChecked=88, Total=2162 [2022-07-12 03:40:09,439 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-12 03:40:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:10,824 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-07-12 03:40:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 03:40:10,825 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-12 03:40:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:10,825 INFO L225 Difference]: With dead ends: 75 [2022-07-12 03:40:10,825 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:40:10,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=339, Invalid=2957, Unknown=14, NotChecked=112, Total=3422 [2022-07-12 03:40:10,826 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 100 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:10,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 297 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 257 Unchecked, 0.8s Time] [2022-07-12 03:40:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:40:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-07-12 03:40:10,830 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-12 03:40:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-07-12 03:40:10,830 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 43 [2022-07-12 03:40:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:10,830 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-07-12 03:40:10,831 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-12 03:40:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-07-12 03:40:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 03:40:10,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:10,831 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-12 03:40:10,849 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-12 03:40:11,041 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-12 03:40:11,041 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash 733721960, now seen corresponding path program 1 times [2022-07-12 03:40:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:11,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812425127] [2022-07-12 03:40:11,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:11,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:11,398 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-12 03:40:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:11,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812425127] [2022-07-12 03:40:11,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812425127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:11,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545984087] [2022-07-12 03:40:11,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:11,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:11,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:11,408 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-12 03:40:11,432 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-12 03:40:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:11,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 03:40:11,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:11,682 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-12 03:40:11,699 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:40:11,699 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-12 03:40:11,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,738 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-12 03:40:11,763 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-12 03:40:11,825 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:40:11,825 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-12 03:40:11,849 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-12 03:40:11,860 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:40:11,861 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-12 03:40:11,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,866 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-12 03:40:11,903 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:11,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, 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-12 03:40:11,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:11,909 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-12 03:40:11,913 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-12 03:40:12,045 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-12 03:40:12,048 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-12 03:40:12,072 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-12 03:40:12,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:12,217 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-12 03:40:12,234 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:12,234 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-12 03:40:12,238 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-12 03:40:12,243 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-12 03:40:12,256 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:12,256 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-12 03:40:12,259 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-12 03:40:12,261 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-12 03:40:12,323 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (not .cse4))) (and (or (and (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_105 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694) (+ 16 v_arrayElimCell_105)) 0) (forall ((v_arrayElimCell_103 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694))) v_arrayElimCell_103) (+ 16 v_arrayElimCell_105)) 0)))) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_105 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694) (+ 16 v_arrayElimCell_105)) 0) (forall ((v_arrayElimCell_103 Int)) (let ((.cse1 (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694))) v_arrayElimCell_103))) (or (= (select .cse1 (+ 16 v_arrayElimCell_105)) 0) (= 0 (select .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16))))))))) .cse3) (or (forall ((v_ArrVal_2688 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0)) .cse4) (or .cse3 (and (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (= (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (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_2694))) v_arrayElimCell_103) (+ 16 v_arrayElimCell_105)) 0)) (forall ((v_ArrVal_2694 Int) (v_ArrVal_2688 (Array Int Int)) (v_arrayElimCell_103 Int) (v_arrayElimCell_105 Int)) (let ((.cse6 (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694))) v_arrayElimCell_103))) (or (= (select .cse6 (+ 16 v_arrayElimCell_105)) 0) (= 0 (select .cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)))))))) (forall ((v_ArrVal_2688 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0) (forall ((v_ArrVal_2694 Int) (v_arrayElimCell_105 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694) (+ 16 v_arrayElimCell_105)) 0) (forall ((v_arrayElimCell_103 Int)) (= (select (select (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (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_2694))) v_arrayElimCell_103) (+ 16 v_arrayElimCell_105)) 0)))))) (forall ((v_ArrVal_2688 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16)) 0) (forall ((v_ArrVal_2694 Int) (v_arrayElimCell_105 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694) (+ 16 v_arrayElimCell_105)) 0) (forall ((v_arrayElimCell_103 Int)) (let ((.cse9 (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2688))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2694))) v_arrayElimCell_103))) (or (= (select .cse9 (+ 16 v_arrayElimCell_105)) 0) (= 0 (select .cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 16))))))))))))) is different from false [2022-07-12 03:40:12,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:12,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-07-12 03:40:12,434 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:12,434 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-12 03:40:12,451 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-12 03:40:12,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 71 [2022-07-12 03:40:12,505 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-12 03:40:12,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 59 [2022-07-12 03:40:13,230 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-12 03:40:13,231 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-12 03:40:13,248 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 70 treesize of output 58 [2022-07-12 03:40:13,252 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 28 treesize of output 24 [2022-07-12 03:40:13,255 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 42 treesize of output 34 [2022-07-12 03:40:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 37 proven. 10 refuted. 1 times theorem prover too weak. 7 trivial. 6 not checked. [2022-07-12 03:40:13,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545984087] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:13,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:40:13,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 41 [2022-07-12 03:40:13,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819473551] [2022-07-12 03:40:13,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:13,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 03:40:13,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:40:13,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 03:40:13,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1329, Unknown=8, NotChecked=150, Total=1640 [2022-07-12 03:40:13,406 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-12 03:40:14,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:14,627 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-07-12 03:40:14,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 03:40:14,627 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-12 03:40:14,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:14,627 INFO L225 Difference]: With dead ends: 64 [2022-07-12 03:40:14,627 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:40:14,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=338, Invalid=2313, Unknown=9, NotChecked=202, Total=2862 [2022-07-12 03:40:14,629 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 109 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:14,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 256 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 421 Invalid, 0 Unknown, 393 Unchecked, 0.6s Time] [2022-07-12 03:40:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:40:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-07-12 03:40:14,632 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-12 03:40:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-12 03:40:14,632 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 43 [2022-07-12 03:40:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:14,632 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-12 03:40:14,633 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-12 03:40:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-12 03:40:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 03:40:14,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:14,633 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-12 03:40:14,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 03:40:14,843 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-12 03:40:14,843 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 206461501, now seen corresponding path program 1 times [2022-07-12 03:40:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:14,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374172412] [2022-07-12 03:40:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:15,147 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-12 03:40:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:15,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374172412] [2022-07-12 03:40:15,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374172412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:15,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62379470] [2022-07-12 03:40:15,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:15,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:15,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:15,149 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-12 03:40:15,153 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-12 03:40:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:15,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 03:40:15,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:15,417 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-12 03:40:15,435 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:40:15,436 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-12 03:40:15,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,483 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-12 03:40:15,516 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-12 03:40:15,592 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-12 03:40:15,592 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-12 03:40:15,623 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:40:15,623 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-12 03:40:15,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,630 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-12 03:40:15,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 03:40:15,673 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:15,673 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-12 03:40:15,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,681 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-12 03:40:15,683 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-12 03:40:15,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:15,870 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-12 03:40:15,873 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:40:15,873 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-12 03:40:15,902 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-12 03:40:15,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:16,090 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3040 Int) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3038 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3036) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3040)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) .cse1) 0) (= .cse1 0))))) (forall ((v_ArrVal_3040 Int) (v_ArrVal_3036 (Array Int Int)) (v_ArrVal_3038 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3038) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3))) (or (= .cse2 0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3040)) .cse2) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3036) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3)) 0)))))) is different from false [2022-07-12 03:40:16,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:16,103 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:16,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 77 [2022-07-12 03:40:16,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:16,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 116 [2022-07-12 03:40:16,114 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-12 03:40:16,127 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:16,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 98 [2022-07-12 03:40:16,133 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:40:16,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 141 [2022-07-12 03:40:16,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 108 [2022-07-12 03:40:16,297 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:16,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 89 [2022-07-12 03:40:16,302 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:40:16,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 135 [2022-07-12 03:40:16,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-07-12 03:40:16,318 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:16,319 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-12 03:40:16,324 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 03:40:16,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 146 treesize of output 122 [2022-07-12 03:40:16,327 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-12 03:40:17,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:17,389 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-12 03:40:17,407 INFO L356 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2022-07-12 03:40:17,407 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 60 [2022-07-12 03:40:17,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:17,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-12 03:40:17,475 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-12 03:40:17,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 51 [2022-07-12 03:40:17,952 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-12 03:40:17,953 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 41 treesize of output 62 [2022-07-12 03:40:17,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,957 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-12 03:40:17,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 03:40:17,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:17,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:17,991 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 173 treesize of output 109 [2022-07-12 03:40:17,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:18,004 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:18,005 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 2386 treesize of output 2292 [2022-07-12 03:40:18,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:18,042 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 1520 treesize of output 1444 [2022-07-12 03:40:18,053 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 1414 treesize of output 1382 [2022-07-12 03:40:18,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-12 03:40:18,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:18,139 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 1392 treesize of output 1382 [2022-07-12 03:40:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-07-12 03:40:19,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62379470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:19,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:40:19,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 43 [2022-07-12 03:40:19,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460867401] [2022-07-12 03:40:19,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:19,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 03:40:19,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:40:19,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 03:40:19,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1557, Unknown=5, NotChecked=80, Total=1806 [2022-07-12 03:40:19,461 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-12 03:40:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:20,479 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2022-07-12 03:40:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 03:40:20,479 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-12 03:40:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:20,480 INFO L225 Difference]: With dead ends: 69 [2022-07-12 03:40:20,480 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 03:40:20,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=321, Invalid=2434, Unknown=5, NotChecked=102, Total=2862 [2022-07-12 03:40:20,481 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 103 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:20,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 269 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 383 Invalid, 0 Unknown, 115 Unchecked, 0.5s Time] [2022-07-12 03:40:20,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 03:40:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2022-07-12 03:40:20,485 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-12 03:40:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-07-12 03:40:20,485 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 44 [2022-07-12 03:40:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:20,485 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-07-12 03:40:20,486 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-12 03:40:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-07-12 03:40:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 03:40:20,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:20,486 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-12 03:40:20,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 03:40:20,694 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-12 03:40:20,694 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash 208308543, now seen corresponding path program 1 times [2022-07-12 03:40:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:20,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827745958] [2022-07-12 03:40:20,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:20,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:21,004 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-12 03:40:21,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:21,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827745958] [2022-07-12 03:40:21,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827745958] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:21,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048407100] [2022-07-12 03:40:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:21,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:21,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:21,006 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-12 03:40:21,012 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-12 03:40:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:21,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 03:40:21,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:21,301 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-12 03:40:21,349 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:40:21,349 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-12 03:40:21,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:21,389 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-12 03:40:21,424 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:21,425 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-12 03:40:21,484 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 03:40:21,485 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-12 03:40:21,525 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 03:40:21,526 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-12 03:40:21,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:21,531 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-12 03:40:21,534 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-12 03:40:21,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:21,581 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-12 03:40:21,581 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-12 03:40:21,584 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-12 03:40:21,757 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-12 03:40:21,799 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-12 03:40:21,799 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-12 03:40:21,818 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-12 03:40:21,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:21,960 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-12 03:40:21,977 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 03:40:21,977 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-12 03:40:21,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:21,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:21,986 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-12 03:40:21,992 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-12 03:40:22,009 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-12 03:40:22,157 INFO L356 Elim1Store]: treesize reduction 18, result has 57.1 percent of original size [2022-07-12 03:40:22,157 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-12 03:40:22,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:22,175 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-12 03:40:22,396 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 03:40:22,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 81 [2022-07-12 03:40:22,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:22,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:22,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 643 treesize of output 563 [2022-07-12 03:40:22,421 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:22,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 563 treesize of output 371 [2022-07-12 03:40:22,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 158 [2022-07-12 03:40:22,650 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 2 not checked. [2022-07-12 03:40:22,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048407100] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:40:22,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:40:22,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 46 [2022-07-12 03:40:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324398880] [2022-07-12 03:40:22,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:40:22,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 03:40:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:40:22,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 03:40:22,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1833, Unknown=11, NotChecked=86, Total=2070 [2022-07-12 03:40:22,652 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-12 03:40:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:40:24,914 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-07-12 03:40:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 03:40:24,915 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-12 03:40:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:40:24,915 INFO L225 Difference]: With dead ends: 64 [2022-07-12 03:40:24,915 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 03:40:24,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=573, Invalid=3452, Unknown=11, NotChecked=124, Total=4160 [2022-07-12 03:40:24,916 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:40:24,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 471 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 485 Invalid, 0 Unknown, 219 Unchecked, 0.7s Time] [2022-07-12 03:40:24,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 03:40:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-12 03:40:24,920 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-12 03:40:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-07-12 03:40:24,920 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 44 [2022-07-12 03:40:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:40:24,920 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-07-12 03:40:24,920 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-12 03:40:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-07-12 03:40:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 03:40:24,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:40:24,921 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-12 03:40:24,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:40:25,135 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-12 03:40:25,135 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:40:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:40:25,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1765953289, now seen corresponding path program 2 times [2022-07-12 03:40:25,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:40:25,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718105566] [2022-07-12 03:40:25,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:40:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:40:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:40:25,771 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-12 03:40:25,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:40:25,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718105566] [2022-07-12 03:40:25,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718105566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:40:25,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135368547] [2022-07-12 03:40:25,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:40:25,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:40:25,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:40:25,773 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-12 03:40:25,774 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-12 03:40:26,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:40:26,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:40:26,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-12 03:40:26,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:40:26,046 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-12 03:40:26,064 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:40:26,064 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-12 03:40:26,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,109 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-12 03:40:26,147 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-12 03:40:26,239 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 03:40:26,239 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-12 03:40:26,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,312 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-12 03:40:26,315 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-12 03:40:26,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,321 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-12 03:40:26,398 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:40:26,398 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-12 03:40:26,402 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-12 03:40:26,406 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-12 03:40:26,553 INFO L356 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-07-12 03:40:26,553 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-12 03:40:26,620 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 03:40:26,621 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-12 03:40:26,623 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-12 03:40:26,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,632 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-12 03:40:26,638 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-12 03:40:26,642 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-12 03:40:26,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:26,703 INFO L356 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2022-07-12 03:40:26,723 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-12 03:40:26,733 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-12 03:40:26,734 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-12 03:40:26,737 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-12 03:40:27,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:27,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:27,216 INFO L356 Elim1Store]: treesize reduction 59, result has 4.8 percent of original size [2022-07-12 03:40:27,217 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 155 treesize of output 61 [2022-07-12 03:40:27,223 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:40:27,223 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-12 03:40:27,262 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-12 03:40:27,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:40:27,431 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-12 03:40:27,450 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-07-12 03:40:27,451 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-12 03:40:27,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:27,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:27,468 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-12 03:40:27,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_3738 Int) (v_arrayElimArr_46 (Array Int Int)) (v_arrayElimArr_47 (Array Int Int)) (v_ArrVal_3730 (Array Int Int)) (v_ArrVal_3735 (Array Int Int))) (let ((.cse0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_46 .cse0))) (not (= (select v_arrayElimArr_47 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12))) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_46))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3738)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_47))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (.cse3 (+ 4 (select (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3730) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3735) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) 0)))) is different from false [2022-07-12 03:40:27,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3717 (Array Int Int)) (v_ArrVal_3715 Int) (v_ArrVal_3738 Int) (v_ArrVal_3719 (Array Int Int)) (v_arrayElimArr_46 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.offset_39| Int) (v_arrayElimArr_47 (Array Int Int)) (v_ArrVal_3730 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| Int) (v_ArrVal_3735 (Array Int Int))) (let ((.cse4 (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.offset_39| 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) 0)) (= 0 (let ((.cse6 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse3 (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3719) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_arrayElimArr_46))) (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_3738)))) (.cse0 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3717) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_arrayElimArr_47))) (store .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|))))) (let ((.cse1 (select (select .cse0 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) .cse4)) (.cse2 (+ (select (select .cse3 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) .cse4) 4))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_3715)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_ArrVal_3730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3735) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))))) (not (= (select v_arrayElimArr_47 .cse4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select v_arrayElimArr_46 .cse4) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) is different from false [2022-07-12 03:40:27,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:27,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:27,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 377 treesize of output 308 [2022-07-12 03:40:27,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:40:27,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:27,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 287 treesize of output 218 [2022-07-12 03:40:27,900 INFO L356 Elim1Store]: treesize reduction 32, result has 11.1 percent of original size [2022-07-12 03:40:27,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155616 treesize of output 151874 [2022-07-12 03:40:28,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:28,355 INFO L356 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2022-07-12 03:40:28,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 10263424 treesize of output 9953551 [2022-07-12 03:40:37,222 WARN L233 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 3868 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 03:40:45,642 WARN L233 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3865 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 03:40:46,390 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:46,396 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 15358142 treesize of output 13797560 [2022-07-12 03:41:01,012 WARN L233 SmtUtils]: Spent 14.61s on a formula simplification that was a NOOP. DAG size: 4058 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 03:41:14,438 WARN L233 SmtUtils]: Spent 13.41s on a formula simplification that was a NOOP. DAG size: 3504 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 03:41:15,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:15,093 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 14293996 treesize of output 14034354 [2022-07-12 03:41:43,847 WARN L233 SmtUtils]: Spent 28.75s on a formula simplification. DAG size of input: 3695 DAG size of output: 3694 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 03:41:56,502 WARN L233 SmtUtils]: Spent 12.64s on a formula simplification that was a NOOP. DAG size: 3512 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 03:41:57,406 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:57,412 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 13628418 treesize of output 13164878