./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 35987657 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-?-3598765 [2022-07-21 02:23:47,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:23:47,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:23:47,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:23:47,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:23:48,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:23:48,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:23:48,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:23:48,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:23:48,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:23:48,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:23:48,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:23:48,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:23:48,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:23:48,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:23:48,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:23:48,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:23:48,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:23:48,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:23:48,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:23:48,026 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:23:48,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:23:48,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:23:48,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:23:48,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:23:48,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:23:48,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:23:48,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:23:48,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:23:48,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:23:48,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:23:48,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:23:48,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:23:48,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:23:48,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:23:48,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:23:48,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:23:48,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:23:48,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:23:48,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:23:48,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:23:48,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:23:48,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:23:48,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:23:48,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:23:48,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:23:48,075 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:23:48,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:23:48,076 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:23:48,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:23:48,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:23:48,077 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:23:48,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:23:48,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:23:48,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:23:48,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:23:48,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:23:48,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:23:48,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:23:48,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:23:48,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:23:48,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:23:48,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:23:48,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:23:48,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:23:48,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:23:48,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:23:48,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:23:48,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:23:48,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:23:48,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:23:48,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:23:48,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:23:48,081 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:23:48,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:23:48,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:23:48,081 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-21 02:23:48,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:23:48,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:23:48,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:23:48,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:23:48,383 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:23:48,384 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-21 02:23:48,435 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb8776a1/ad4ef0a736fd46e3a3c16e2e75a0d97a/FLAG3ce87459c [2022-07-21 02:23:48,815 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:23:48,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2022-07-21 02:23:48,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb8776a1/ad4ef0a736fd46e3a3c16e2e75a0d97a/FLAG3ce87459c [2022-07-21 02:23:49,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb8776a1/ad4ef0a736fd46e3a3c16e2e75a0d97a [2022-07-21 02:23:49,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:23:49,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:23:49,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:23:49,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:23:49,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:23:49,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@509c50e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49, skipping insertion in model container [2022-07-21 02:23:49,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:23:49,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:23:49,449 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-21 02:23:49,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:23:49,464 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:23:49,511 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-21 02:23:49,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:23:49,539 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:23:49,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49 WrapperNode [2022-07-21 02:23:49,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:23:49,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:23:49,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:23:49,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:23:49,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,589 INFO L137 Inliner]: procedures = 122, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2022-07-21 02:23:49,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:23:49,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:23:49,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:23:49,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:23:49,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:23:49,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:23:49,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:23:49,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:23:49,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (1/1) ... [2022-07-21 02:23:49,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:23:49,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:49,679 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-21 02:23:49,684 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-21 02:23:49,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:23:49,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:23:49,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:23:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:23:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:23:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:23:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:23:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:23:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:23:49,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:23:49,803 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:23:49,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:23:49,956 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:23:49,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:23:49,961 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 02:23:49,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:23:49 BoogieIcfgContainer [2022-07-21 02:23:49,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:23:49,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:23:49,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:23:49,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:23:49,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:23:49" (1/3) ... [2022-07-21 02:23:49,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b445092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:23:49, skipping insertion in model container [2022-07-21 02:23:49,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:49" (2/3) ... [2022-07-21 02:23:49,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b445092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:23:49, skipping insertion in model container [2022-07-21 02:23:49,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:23:49" (3/3) ... [2022-07-21 02:23:49,969 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2022-07-21 02:23:49,979 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:23:49,980 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:23:50,033 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:23:50,039 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@21f6aa46, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@54f5ab53 [2022-07-21 02:23:50,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:23:50,048 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-21 02:23:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 02:23:50,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:50,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:50,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:50,059 INFO L85 PathProgramCache]: Analyzing trace with hash -91270904, now seen corresponding path program 1 times [2022-07-21 02:23:50,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:50,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644891997] [2022-07-21 02:23:50,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:50,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:50,206 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-21 02:23:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:50,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644891997] [2022-07-21 02:23:50,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644891997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:23:50,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:23:50,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:23:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114245387] [2022-07-21 02:23:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:23:50,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:23:50,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:50,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:23:50,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:23:50,242 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-21 02:23:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:50,288 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2022-07-21 02:23:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:23:50,290 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-21 02:23:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:50,295 INFO L225 Difference]: With dead ends: 52 [2022-07-21 02:23:50,296 INFO L226 Difference]: Without dead ends: 27 [2022-07-21 02:23:50,298 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-21 02:23:50,302 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-21 02:23:50,303 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-21 02:23:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-21 02:23:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-07-21 02:23:50,328 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-21 02:23:50,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-07-21 02:23:50,332 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-07-21 02:23:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:50,332 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-07-21 02:23:50,333 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-21 02:23:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-07-21 02:23:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:23:50,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:50,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:50,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:23:50,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1034399597, now seen corresponding path program 1 times [2022-07-21 02:23:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:50,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497933912] [2022-07-21 02:23:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:50,471 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-21 02:23:50,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497933912] [2022-07-21 02:23:50,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497933912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:23:50,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:23:50,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:23:50,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643475961] [2022-07-21 02:23:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:23:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:23:50,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:23:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:23:50,477 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-21 02:23:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:50,516 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-21 02:23:50,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:23:50,517 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-21 02:23:50,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:50,518 INFO L225 Difference]: With dead ends: 47 [2022-07-21 02:23:50,519 INFO L226 Difference]: Without dead ends: 27 [2022-07-21 02:23:50,522 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-21 02:23:50,523 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-21 02:23:50,524 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-21 02:23:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-21 02:23:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-21 02:23:50,532 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-21 02:23:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-21 02:23:50,533 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-07-21 02:23:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:50,537 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-21 02:23:50,538 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-21 02:23:50,538 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-21 02:23:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:23:50,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:50,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:50,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:23:50,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:50,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:50,543 INFO L85 PathProgramCache]: Analyzing trace with hash -776234159, now seen corresponding path program 1 times [2022-07-21 02:23:50,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:50,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799739816] [2022-07-21 02:23:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:50,628 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-21 02:23:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:50,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799739816] [2022-07-21 02:23:50,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799739816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:23:50,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:23:50,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 02:23:50,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221694644] [2022-07-21 02:23:50,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:23:50,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:23:50,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:50,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:23:50,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:23:50,631 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-21 02:23:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:50,879 INFO L93 Difference]: Finished difference Result 71 states and 98 transitions. [2022-07-21 02:23:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 02:23:50,879 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-21 02:23:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:50,880 INFO L225 Difference]: With dead ends: 71 [2022-07-21 02:23:50,880 INFO L226 Difference]: Without dead ends: 58 [2022-07-21 02:23:50,881 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-21 02:23:50,881 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-21 02:23:50,882 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-21 02:23:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-21 02:23:50,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2022-07-21 02:23:50,891 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-21 02:23:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-21 02:23:50,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 17 [2022-07-21 02:23:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:50,892 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-21 02:23:50,892 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-21 02:23:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-07-21 02:23:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 02:23:50,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:50,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:50,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 02:23:50,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash -774387117, now seen corresponding path program 1 times [2022-07-21 02:23:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:50,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747141137] [2022-07-21 02:23:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:50,960 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-21 02:23:50,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747141137] [2022-07-21 02:23:50,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747141137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:50,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704845343] [2022-07-21 02:23:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:50,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:50,975 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-21 02:23:50,996 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-21 02:23:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:51,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:23:51,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:51,112 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-21 02:23:51,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:51,152 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-21 02:23:51,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704845343] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:23:51,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:23:51,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-21 02:23:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522496605] [2022-07-21 02:23:51,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:23:51,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 02:23:51,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 02:23:51,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-21 02:23:51,154 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-21 02:23:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:51,171 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2022-07-21 02:23:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:23:51,171 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-21 02:23:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:51,189 INFO L225 Difference]: With dead ends: 69 [2022-07-21 02:23:51,189 INFO L226 Difference]: Without dead ends: 49 [2022-07-21 02:23:51,190 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-21 02:23:51,190 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-21 02:23:51,191 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-21 02:23:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-21 02:23:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-21 02:23:51,196 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-21 02:23:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2022-07-21 02:23:51,197 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 17 [2022-07-21 02:23:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:51,197 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2022-07-21 02:23:51,197 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-21 02:23:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-07-21 02:23:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 02:23:51,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:51,198 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-21 02:23:51,219 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-21 02:23:51,399 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-21 02:23:51,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -459646902, now seen corresponding path program 1 times [2022-07-21 02:23:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:51,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328912169] [2022-07-21 02:23:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:51,550 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-21 02:23:51,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:51,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328912169] [2022-07-21 02:23:51,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328912169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:51,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292195263] [2022-07-21 02:23:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:51,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:51,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:51,572 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-21 02:23:51,575 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-21 02:23:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:51,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 02:23:51,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:51,754 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-21 02:23:51,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:51,827 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-21 02:23:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292195263] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:23:51,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:23:51,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-07-21 02:23:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844625018] [2022-07-21 02:23:51,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:23:51,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:23:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:51,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:23:51,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:23:51,834 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-21 02:23:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:51,867 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2022-07-21 02:23:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 02:23:51,868 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-21 02:23:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:51,868 INFO L225 Difference]: With dead ends: 72 [2022-07-21 02:23:51,868 INFO L226 Difference]: Without dead ends: 52 [2022-07-21 02:23:51,869 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-21 02:23:51,869 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-21 02:23:51,869 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-21 02:23:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-21 02:23:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-07-21 02:23:51,873 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-21 02:23:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-07-21 02:23:51,873 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 32 [2022-07-21 02:23:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:51,874 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-07-21 02:23:51,874 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-21 02:23:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-07-21 02:23:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 02:23:51,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:51,874 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-21 02:23:51,894 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-21 02:23:52,087 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-21 02:23:52,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash -910589295, now seen corresponding path program 2 times [2022-07-21 02:23:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:52,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849881184] [2022-07-21 02:23:52,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:52,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:52,298 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-21 02:23:52,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:52,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849881184] [2022-07-21 02:23:52,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849881184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026905647] [2022-07-21 02:23:52,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:23:52,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:52,300 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-21 02:23:52,301 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-21 02:23:52,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:23:52,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:23:52,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-21 02:23:52,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:52,462 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-21 02:23:52,482 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:23:52,482 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-21 02:23:52,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:52,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-21 02:23:52,576 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-21 02:23:52,656 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-21 02:23:52,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:52,672 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-21 02:23:52,733 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-21 02:23:52,734 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-21 02:23:52,740 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-07-21 02:23:52,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 40 treesize of output 26 [2022-07-21 02:23:52,757 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-21 02:23:52,793 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-21 02:23:52,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026905647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:23:52,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:23:52,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2022-07-21 02:23:52,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195597354] [2022-07-21 02:23:52,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:23:52,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 02:23:52,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:52,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 02:23:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2022-07-21 02:23:52,796 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-21 02:23:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:53,361 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2022-07-21 02:23:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 02:23:53,361 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-21 02:23:53,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:53,368 INFO L225 Difference]: With dead ends: 86 [2022-07-21 02:23:53,368 INFO L226 Difference]: Without dead ends: 73 [2022-07-21 02:23:53,369 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-21 02:23:53,370 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 356 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:23:53,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 103 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 202 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2022-07-21 02:23:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-21 02:23:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-21 02:23:53,382 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-21 02:23:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-07-21 02:23:53,383 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 37 [2022-07-21 02:23:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:53,383 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-07-21 02:23:53,383 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-21 02:23:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-07-21 02:23:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 02:23:53,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:53,384 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-21 02:23:53,403 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-21 02:23:53,599 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-21 02:23:53,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash -908742253, now seen corresponding path program 1 times [2022-07-21 02:23:53,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:53,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642451530] [2022-07-21 02:23:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:53,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:53,777 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-21 02:23:53,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:53,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642451530] [2022-07-21 02:23:53,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642451530] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:53,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968722680] [2022-07-21 02:23:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:53,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:53,781 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-21 02:23:53,781 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-21 02:23:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:53,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 02:23:53,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:53,945 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-21 02:23:53,958 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:23:53,958 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-21 02:23:54,010 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-21 02:23:54,010 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-21 02:23:54,043 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-21 02:23:54,096 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-21 02:23:54,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:54,119 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-21 02:23:54,169 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-21 02:23:54,169 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-21 02:23:54,174 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-21 02:23:54,202 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-21 02:23:54,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968722680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:23:54,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:23:54,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-07-21 02:23:54,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203335804] [2022-07-21 02:23:54,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:23:54,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 02:23:54,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:54,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 02:23:54,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=365, Unknown=1, NotChecked=38, Total=462 [2022-07-21 02:23:54,205 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-21 02:23:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:54,662 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-07-21 02:23:54,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 02:23:54,663 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-21 02:23:54,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:54,663 INFO L225 Difference]: With dead ends: 76 [2022-07-21 02:23:54,663 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 02:23:54,664 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-21 02:23:54,664 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 197 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:23:54,665 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-21 02:23:54,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 02:23:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-07-21 02:23:54,669 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-21 02:23:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-07-21 02:23:54,669 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 37 [2022-07-21 02:23:54,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:54,669 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-07-21 02:23:54,670 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-21 02:23:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-07-21 02:23:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 02:23:54,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:54,671 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-21 02:23:54,704 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-21 02:23:54,902 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-21 02:23:54,903 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:54,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash -908740331, now seen corresponding path program 1 times [2022-07-21 02:23:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:54,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151369621] [2022-07-21 02:23:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:55,068 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-21 02:23:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:55,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151369621] [2022-07-21 02:23:55,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151369621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:55,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742577337] [2022-07-21 02:23:55,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:55,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:55,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:55,084 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-21 02:23:55,093 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-21 02:23:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:55,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-21 02:23:55,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:55,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-21 02:23:55,290 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:23:55,290 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-21 02:23:55,335 INFO L356 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-07-21 02:23:55,335 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-21 02:23:55,351 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-21 02:23:55,413 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-21 02:23:55,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:55,432 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-21 02:23:55,490 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-21 02:23:55,490 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-21 02:23:55,493 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-21 02:23:55,528 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-21 02:23:55,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742577337] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:23:55,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:23:55,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2022-07-21 02:23:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556731701] [2022-07-21 02:23:55,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:23:55,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 02:23:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 02:23:55,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=327, Unknown=1, NotChecked=36, Total=420 [2022-07-21 02:23:55,530 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-21 02:23:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:55,881 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-07-21 02:23:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 02:23:55,882 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-21 02:23:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:55,882 INFO L225 Difference]: With dead ends: 65 [2022-07-21 02:23:55,882 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 02:23:55,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=634, Unknown=1, NotChecked=54, Total=870 [2022-07-21 02:23:55,883 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-21 02:23:55,884 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-21 02:23:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 02:23:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-07-21 02:23:55,887 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-21 02:23:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-07-21 02:23:55,888 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 37 [2022-07-21 02:23:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:55,888 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-07-21 02:23:55,888 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-21 02:23:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-07-21 02:23:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 02:23:55,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:55,889 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-21 02:23:55,920 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-21 02:23:56,099 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-21 02:23:56,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:56,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash 829738032, now seen corresponding path program 1 times [2022-07-21 02:23:56,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:56,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408446625] [2022-07-21 02:23:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:56,241 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-21 02:23:56,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408446625] [2022-07-21 02:23:56,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408446625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317091157] [2022-07-21 02:23:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:56,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:56,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:56,243 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-21 02:23:56,244 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-21 02:23:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:56,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 02:23:56,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:56,447 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-21 02:23:56,485 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:23:56,485 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-21 02:23:56,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:56,513 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-21 02:23:56,541 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:23:56,541 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-21 02:23:56,635 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-21 02:23:56,665 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-21 02:23:56,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:56,744 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-21 02:23:56,755 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-21 02:23:56,755 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-21 02:23:56,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 39 treesize of output 27 [2022-07-21 02:23:56,761 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-21 02:23:56,884 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-21 02:23:56,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317091157] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:23:56,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:23:56,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-21 02:23:56,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337759622] [2022-07-21 02:23:56,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:23:56,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 02:23:56,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:56,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 02:23:56,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=634, Unknown=1, NotChecked=50, Total=756 [2022-07-21 02:23:56,886 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-21 02:23:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:57,620 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-07-21 02:23:57,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 02:23:57,620 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-21 02:23:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:57,621 INFO L225 Difference]: With dead ends: 94 [2022-07-21 02:23:57,621 INFO L226 Difference]: Without dead ends: 56 [2022-07-21 02:23:57,621 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-21 02:23:57,622 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-21 02:23:57,622 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-21 02:23:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-21 02:23:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-07-21 02:23:57,626 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-21 02:23:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-21 02:23:57,626 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 38 [2022-07-21 02:23:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:57,626 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-21 02:23:57,627 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-21 02:23:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-21 02:23:57,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-21 02:23:57,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:57,628 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-21 02:23:57,674 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-21 02:23:57,847 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-21 02:23:57,847 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:57,848 INFO L85 PathProgramCache]: Analyzing trace with hash 731872996, now seen corresponding path program 1 times [2022-07-21 02:23:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:57,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367942216] [2022-07-21 02:23:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:57,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:58,170 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-21 02:23:58,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:58,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367942216] [2022-07-21 02:23:58,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367942216] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:58,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889462138] [2022-07-21 02:23:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:58,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:58,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:58,172 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-21 02:23:58,173 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-21 02:23:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:58,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-21 02:23:58,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:58,381 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-21 02:23:58,399 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:23:58,400 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-21 02:23:58,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,441 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-21 02:23:58,476 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-21 02:23:58,547 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 02:23:58,548 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-21 02:23:58,574 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-21 02:23:58,583 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-21 02:23:58,583 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-21 02:23:58,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,588 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-21 02:23:58,622 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:23:58,622 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-21 02:23:58,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:58,627 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-21 02:23:58,629 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-21 02:23:58,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 33 treesize of output 15 [2022-07-21 02:23:58,760 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-21 02:23:58,784 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-21 02:23:58,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:58,884 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-21 02:23:58,898 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-21 02:23:58,899 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-21 02:23:58,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-21 02:23:58,906 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-21 02:23:58,917 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-21 02:23:58,917 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-21 02:23:58,919 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-21 02:23:58,921 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-21 02:23:59,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_2007))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (not .cse0) (= (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) 0)) (and .cse0 (= (select (select (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 12) v_ArrVal_2013)) v_arrayElimCell_34) v_arrayElimCell_36) 0)))))) is different from false [2022-07-21 02:23:59,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:59,122 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-21 02:23:59,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:59,274 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-21 02:23:59,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_23| Int)) (let ((.cse0 (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_23|) 0)) (and (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_23| v_ArrVal_2007) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (not .cse0)) (and (forall ((v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_23| v_ArrVal_2007))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2013))) v_arrayElimCell_34) v_arrayElimCell_36) 0)) .cse0)))) is different from false [2022-07-21 02:23:59,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:59,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-21 02:23:59,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_23| Int) (v_ArrVal_2000 (Array Int Int))) (let ((.cse0 (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_23|) 0)) (and (not .cse0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2000) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_23| v_ArrVal_2007) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) (and (forall ((v_ArrVal_2013 Int) (v_arrayElimCell_36 Int) (v_arrayElimCell_34 Int)) (= (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2000) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_23| v_ArrVal_2007))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2013))) v_arrayElimCell_34) v_arrayElimCell_36) 0)) .cse0)))) is different from false [2022-07-21 02:23:59,495 INFO L356 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-07-21 02:23:59,496 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 136 treesize of output 100 [2022-07-21 02:23:59,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:59,535 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 2964 treesize of output 2864 [2022-07-21 02:23:59,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:59,577 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 3056 treesize of output 2948 [2022-07-21 02:23:59,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:23:59,616 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 3332 treesize of output 3234