./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-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/heap-manipulation/sll_to_dll_rev-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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:58:36,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:58:36,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:58:36,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:58:36,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:58:36,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:58:36,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:58:36,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:58:36,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:58:36,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:58:36,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:58:36,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:58:36,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:58:36,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:58:36,864 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:58:36,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:58:36,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:58:36,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:58:36,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:58:36,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:58:36,874 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:58:36,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:58:36,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:58:36,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:58:36,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:58:36,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:58:36,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:58:36,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:58:36,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:58:36,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:58:36,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:58:36,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:58:36,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:58:36,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:58:36,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:58:36,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:58:36,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:58:36,891 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:58:36,891 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:58:36,891 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:58:36,892 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:58:36,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:58:36,900 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:58:36,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:58:36,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:58:36,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:58:36,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:58:36,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:58:36,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:58:36,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:58:36,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:58:36,934 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:58:36,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:58:36,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:58:36,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:58:36,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:58:36,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:58:36,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:58:36,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:58:36,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:58:36,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:58:36,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:58:36,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:58:36,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:58:36,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:58:36,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:58:36,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:58:36,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:36,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:58:36,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:58:36,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:58:36,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:58:36,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:58:36,939 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:58:36,939 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:58:36,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:58:36,939 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2022-07-21 01:58:37,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:58:37,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:58:37,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:58:37,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:58:37,244 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:58:37,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2022-07-21 01:58:37,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5ff875e/784774e2be3c4c48aefc1db5a1e9dff1/FLAG955ce9bd0 [2022-07-21 01:58:37,703 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:58:37,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2022-07-21 01:58:37,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5ff875e/784774e2be3c4c48aefc1db5a1e9dff1/FLAG955ce9bd0 [2022-07-21 01:58:37,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5ff875e/784774e2be3c4c48aefc1db5a1e9dff1 [2022-07-21 01:58:37,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:58:37,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:58:37,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:37,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:58:37,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:58:37,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:37" (1/1) ... [2022-07-21 01:58:37,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a68359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:37, skipping insertion in model container [2022-07-21 01:58:37,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:58:37" (1/1) ... [2022-07-21 01:58:37,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:58:37,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:58:38,005 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/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2022-07-21 01:58:38,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:38,041 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:58:38,071 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/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2022-07-21 01:58:38,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:58:38,117 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:58:38,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38 WrapperNode [2022-07-21 01:58:38,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:58:38,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:38,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:58:38,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:58:38,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,172 INFO L137 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 200 [2022-07-21 01:58:38,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:58:38,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:58:38,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:58:38,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:58:38,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:58:38,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:58:38,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:58:38,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:58:38,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (1/1) ... [2022-07-21 01:58:38,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:58:38,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:38,253 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 01:58:38,278 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 01:58:38,304 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-07-21 01:58:38,304 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-07-21 01:58:38,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 01:58:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:58:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 01:58:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 01:58:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 01:58:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2022-07-21 01:58:38,305 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2022-07-21 01:58:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 01:58:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 01:58:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2022-07-21 01:58:38,306 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2022-07-21 01:58:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:58:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2022-07-21 01:58:38,306 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2022-07-21 01:58:38,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:58:38,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:58:38,435 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:58:38,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:58:38,688 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:58:38,693 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:58:38,693 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-07-21 01:58:38,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:38 BoogieIcfgContainer [2022-07-21 01:58:38,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:58:38,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:58:38,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:58:38,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:58:38,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:58:37" (1/3) ... [2022-07-21 01:58:38,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9c473a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:38, skipping insertion in model container [2022-07-21 01:58:38,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:58:38" (2/3) ... [2022-07-21 01:58:38,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9c473a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:58:38, skipping insertion in model container [2022-07-21 01:58:38,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:58:38" (3/3) ... [2022-07-21 01:58:38,712 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2022-07-21 01:58:38,722 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:58:38,722 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:58:38,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:58:38,766 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@7b3e615a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5340019f [2022-07-21 01:58:38,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:58:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 82 states have internal predecessors, (126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-07-21 01:58:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 01:58:38,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:38,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:38,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1660370747, now seen corresponding path program 1 times [2022-07-21 01:58:38,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:38,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854563139] [2022-07-21 01:58:38,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:38,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:38,937 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 01:58:38,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:38,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854563139] [2022-07-21 01:58:38,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854563139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:58:38,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:58:38,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 01:58:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411038423] [2022-07-21 01:58:38,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:58:38,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 01:58:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:38,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 01:58:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:58:38,973 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 82 states have internal predecessors, (126), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:58:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:39,020 INFO L93 Difference]: Finished difference Result 188 states and 326 transitions. [2022-07-21 01:58:39,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 01:58:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 01:58:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:39,033 INFO L225 Difference]: With dead ends: 188 [2022-07-21 01:58:39,033 INFO L226 Difference]: Without dead ends: 88 [2022-07-21 01:58:39,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 01:58:39,042 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:39,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 01:58:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-21 01:58:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-21 01:58:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 75 states have internal predecessors, (83), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 01:58:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-07-21 01:58:39,085 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 16 [2022-07-21 01:58:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:39,086 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-07-21 01:58:39,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:58:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-07-21 01:58:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-21 01:58:39,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:39,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:39,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:58:39,090 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1299807145, now seen corresponding path program 1 times [2022-07-21 01:58:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:39,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210663804] [2022-07-21 01:58:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:39,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:58:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 01:58:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:39,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 01:58:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:39,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 01:58:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:39,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210663804] [2022-07-21 01:58:39,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210663804] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:39,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548719947] [2022-07-21 01:58:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:39,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:39,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:39,921 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 01:58:39,925 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 01:58:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:40,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 01:58:40,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:40,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-07-21 01:58:40,244 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 01:58:40,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 01:58:40,264 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 8 treesize of output 7 [2022-07-21 01:58:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 01:58:40,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:40,307 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 51 treesize of output 9 [2022-07-21 01:58:40,310 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 9 treesize of output 7 [2022-07-21 01:58:40,428 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 24 treesize of output 19 [2022-07-21 01:58:40,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-21 01:58:40,586 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_328 (Array Int Int)) (v_ArrVal_327 (Array Int Int)) (v_ArrVal_329 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= |chain_node_~node~0#1.base| |chain_node_alloc_node_~ptr~0#1.base|) (= (store (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_327) |chain_node_~node~0#1.base| v_ArrVal_328) |c_chain_node_#in~ppnode#1.base| v_ArrVal_329) |c_#memory_$Pointer$.base|) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-07-21 01:58:40,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:40,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:40,632 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-21 01:58:40,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2022-07-21 01:58:40,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 01:58:40,684 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 16 treesize of output 8 [2022-07-21 01:58:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-21 01:58:40,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:40,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (|v_chain_node_alloc_node_~ptr~0#1.base_8| Int) (v_ArrVal_336 (Array Int Int)) (|v_chain_node_~node~0#1.base_4| Int) (v_ArrVal_338 (Array Int Int))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_chain_node_alloc_node_~ptr~0#1.base_8| v_ArrVal_337) |v_chain_node_~node~0#1.base_4| v_ArrVal_338) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|) 0)) (< |v_chain_node_alloc_node_~ptr~0#1.base_8| |v_chain_node_~node~0#1.base_4|) (not (< |v_chain_node_alloc_node_~ptr~0#1.base_8| |c_#StackHeapBarrier|)))) is different from false [2022-07-21 01:58:40,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548719947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:40,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:58:40,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-07-21 01:58:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507377134] [2022-07-21 01:58:40,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:40,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 01:58:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 01:58:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=442, Unknown=3, NotChecked=86, Total=600 [2022-07-21 01:58:40,763 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 01:58:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:41,632 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2022-07-21 01:58:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 01:58:41,633 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-07-21 01:58:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:41,635 INFO L225 Difference]: With dead ends: 150 [2022-07-21 01:58:41,635 INFO L226 Difference]: Without dead ends: 147 [2022-07-21 01:58:41,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=810, Unknown=5, NotChecked=118, Total=1056 [2022-07-21 01:58:41,636 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:41,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 648 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1199 Invalid, 0 Unknown, 277 Unchecked, 0.6s Time] [2022-07-21 01:58:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-21 01:58:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2022-07-21 01:58:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 93 states have internal predecessors, (104), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 01:58:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 133 transitions. [2022-07-21 01:58:41,648 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 133 transitions. Word has length 40 [2022-07-21 01:58:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:41,648 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 133 transitions. [2022-07-21 01:58:41,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-21 01:58:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 133 transitions. [2022-07-21 01:58:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 01:58:41,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:41,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:41,684 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 01:58:41,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:41,869 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:41,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash -727961485, now seen corresponding path program 1 times [2022-07-21 01:58:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:41,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156184414] [2022-07-21 01:58:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:58:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 01:58:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 01:58:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 01:58:42,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:42,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156184414] [2022-07-21 01:58:42,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156184414] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:42,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113982927] [2022-07-21 01:58:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:42,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:42,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:42,449 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 01:58:42,467 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 01:58:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:42,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-21 01:58:42,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:42,619 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 10 treesize of output 8 [2022-07-21 01:58:42,682 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 01:58:42,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 01:58:42,687 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 8 treesize of output 7 [2022-07-21 01:58:42,692 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 12 treesize of output 11 [2022-07-21 01:58:42,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-21 01:58:42,714 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 9 treesize of output 7 [2022-07-21 01:58:42,832 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 01:58:42,832 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 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-21 01:58:42,868 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 01:58:42,869 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 20 treesize of output 8 [2022-07-21 01:58:42,977 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|chain_node_alloc_node_~ptr~0#1.base| Int) (v_ArrVal_643 (Array Int Int))) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (<= |chain_node_~node~0#1.base| |chain_node_alloc_node_~ptr~0#1.base|) (= (store (store (store |c_old(#memory_$Pointer$.base)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_643) |chain_node_~node~0#1.base| v_ArrVal_644) |c_chain_node_#in~ppnode#1.base| v_ArrVal_645) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 01:58:42,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:42,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:43,034 INFO L356 Elim1Store]: treesize reduction 43, result has 47.6 percent of original size [2022-07-21 01:58:43,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 57 [2022-07-21 01:58:43,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-21 01:58:43,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-21 01:58:43,109 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 19 treesize of output 21 [2022-07-21 01:58:43,217 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_649 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_650 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_649) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_650) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$.base|) (not (= |chain_node_~node~0#1.base| 0)))) is different from true [2022-07-21 01:58:43,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:43,263 INFO L356 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2022-07-21 01:58:43,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 101 [2022-07-21 01:58:43,269 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 8 treesize of output 7 [2022-07-21 01:58:43,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 01:58:43,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2022-07-21 01:58:43,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:43,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-07-21 01:58:43,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:43,383 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 51 treesize of output 9 [2022-07-21 01:58:43,386 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 9 treesize of output 7 [2022-07-21 01:58:43,402 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 01:58:43,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:43,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:43,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:43,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 120 [2022-07-21 01:58:43,588 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 12 treesize of output 8 [2022-07-21 01:58:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-07-21 01:58:43,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:58:43,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113982927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:43,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:58:43,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 29 [2022-07-21 01:58:43,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578646089] [2022-07-21 01:58:43,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:58:43,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 01:58:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:58:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 01:58:43,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=660, Unknown=16, NotChecked=106, Total=870 [2022-07-21 01:58:43,739 INFO L87 Difference]: Start difference. First operand 108 states and 133 transitions. Second operand has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 01:58:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:58:44,689 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2022-07-21 01:58:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 01:58:44,690 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-07-21 01:58:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:58:44,691 INFO L225 Difference]: With dead ends: 137 [2022-07-21 01:58:44,691 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 01:58:44,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=168, Invalid=1298, Unknown=24, NotChecked=150, Total=1640 [2022-07-21 01:58:44,692 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 134 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:58:44,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 722 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1102 Invalid, 0 Unknown, 276 Unchecked, 0.6s Time] [2022-07-21 01:58:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 01:58:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 114. [2022-07-21 01:58:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 98 states have internal predecessors, (108), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 01:58:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2022-07-21 01:58:44,710 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 42 [2022-07-21 01:58:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:58:44,711 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2022-07-21 01:58:44,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 23 states have (on average 2.260869565217391) internal successors, (52), 26 states have internal predecessors, (52), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 01:58:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2022-07-21 01:58:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 01:58:44,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:58:44,712 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:58:44,750 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 01:58:44,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-21 01:58:44,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:58:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:58:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1343975071, now seen corresponding path program 1 times [2022-07-21 01:58:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:58:44,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996300557] [2022-07-21 01:58:44,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:58:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:58:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:45,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 01:58:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 01:58:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 01:58:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:58:46,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996300557] [2022-07-21 01:58:46,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996300557] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:58:46,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746304644] [2022-07-21 01:58:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:58:46,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:58:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:58:46,198 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 01:58:46,198 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 01:58:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:58:46,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 139 conjunts are in the unsatisfiable core [2022-07-21 01:58:46,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:58:46,385 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 44 treesize of output 42 [2022-07-21 01:58:46,456 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 01:58:46,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 01:58:46,463 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 8 treesize of output 7 [2022-07-21 01:58:46,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 01:58:46,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:46,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:58:46,486 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 51 treesize of output 9 [2022-07-21 01:58:46,488 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 9 treesize of output 7 [2022-07-21 01:58:46,581 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 15 treesize of output 17 [2022-07-21 01:58:46,630 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 8 treesize of output 4 [2022-07-21 01:58:46,655 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 01:58:46,773 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 01:58:46,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 01:58:46,781 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 8 treesize of output 7 [2022-07-21 01:58:46,788 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 12 treesize of output 11 [2022-07-21 01:58:46,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 56 [2022-07-21 01:58:46,844 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 51 treesize of output 45 [2022-07-21 01:58:47,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 113 [2022-07-21 01:58:47,054 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 14 treesize of output 13 [2022-07-21 01:58:47,059 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 14 treesize of output 13 [2022-07-21 01:58:47,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-21 01:58:47,084 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 9 treesize of output 7 [2022-07-21 01:58:47,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 37 [2022-07-21 01:58:47,098 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 32 treesize of output 20 [2022-07-21 01:58:47,257 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-07-21 01:58:47,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 45 [2022-07-21 01:58:47,272 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 01:58:47,272 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2022-07-21 01:58:47,348 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 01:58:47,348 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 28 treesize of output 16 [2022-07-21 01:58:47,358 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-21 01:58:47,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 23 [2022-07-21 01:58:47,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 01:58:47,508 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_982 (Array Int Int)) (|chain_node_~node~0#1.offset| Int) (v_ArrVal_983 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_982 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_982) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|))) |c_#memory_$Pointer$.base|) (= (let ((.cse1 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_983 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_983) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse1 |c_chain_node_#in~ppnode#1.base| (store (select .cse1 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.offset|))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 01:58:47,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,561 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-21 01:58:47,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 57 [2022-07-21 01:58:47,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:47,611 INFO L356 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-07-21 01:58:47,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 88 [2022-07-21 01:58:47,624 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 10 treesize of output 9 [2022-07-21 01:58:47,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 01:58:47,644 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-21 01:58:47,644 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 13 treesize of output 13 [2022-07-21 01:58:47,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-21 01:58:48,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 99 [2022-07-21 01:58:48,213 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 0 case distinctions, treesize of input 55 treesize of output 51 [2022-07-21 01:58:48,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:48,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:58:48,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:58:48,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 146 [2022-07-21 01:59:28,620 INFO L356 Elim1Store]: treesize reduction 88, result has 24.8 percent of original size [2022-07-21 01:59:28,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 99 [2022-07-21 01:59:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-21 01:59:28,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:28,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.offset_10| Int) (|v_chain_node_~node~0#1.base_10| Int) (v_ArrVal_1013 (Array Int Int)) (v_ArrVal_1012 (Array Int Int))) (or (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_10|) 0)) (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_10| (store v_ArrVal_1012 |v_chain_node_~node~0#1.offset_10| (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_10| v_ArrVal_1012) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| |v_chain_node_~node~0#1.base_10|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_10| (store v_ArrVal_1013 |v_chain_node_~node~0#1.offset_10| (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_10| v_ArrVal_1013) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse2 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| |v_chain_node_~node~0#1.offset_10|))) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) 0)) (not (< |v_chain_node_~node~0#1.base_10| |c_#StackHeapBarrier|)))) is different from false [2022-07-21 01:59:28,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746304644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:28,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:28,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 39 [2022-07-21 01:59:28,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801861678] [2022-07-21 01:59:28,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:28,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-21 01:59:28,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-21 01:59:28,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1284, Unknown=24, NotChecked=146, Total=1560 [2022-07-21 01:59:28,836 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 39 states, 31 states have (on average 2.193548387096774) internal successors, (68), 34 states have internal predecessors, (68), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 01:59:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:30,388 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2022-07-21 01:59:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-21 01:59:30,390 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.193548387096774) internal successors, (68), 34 states have internal predecessors, (68), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-21 01:59:30,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:30,391 INFO L225 Difference]: With dead ends: 145 [2022-07-21 01:59:30,391 INFO L226 Difference]: Without dead ends: 142 [2022-07-21 01:59:30,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=194, Invalid=2240, Unknown=24, NotChecked=194, Total=2652 [2022-07-21 01:59:30,393 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 140 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 505 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:30,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1116 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1329 Invalid, 0 Unknown, 505 Unchecked, 0.8s Time] [2022-07-21 01:59:30,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-21 01:59:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2022-07-21 01:59:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 100 states have internal predecessors, (111), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 01:59:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2022-07-21 01:59:30,409 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 46 [2022-07-21 01:59:30,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:30,410 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2022-07-21 01:59:30,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.193548387096774) internal successors, (68), 34 states have internal predecessors, (68), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 01:59:30,411 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2022-07-21 01:59:30,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 01:59:30,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:30,412 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:30,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 01:59:30,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:30,628 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:30,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1320962275, now seen corresponding path program 1 times [2022-07-21 01:59:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:30,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229374720] [2022-07-21 01:59:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:30,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:30,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:59:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:30,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 01:59:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:30,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 01:59:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 01:59:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 01:59:31,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:31,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229374720] [2022-07-21 01:59:31,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229374720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:31,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24699155] [2022-07-21 01:59:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:31,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:31,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:31,343 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 01:59:31,344 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 01:59:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:31,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-21 01:59:31,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:31,530 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 14 treesize of output 12 [2022-07-21 01:59:31,649 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 01:59:31,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 01:59:31,653 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 8 treesize of output 7 [2022-07-21 01:59:31,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 01:59:31,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:31,674 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 51 treesize of output 9 [2022-07-21 01:59:31,678 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 9 treesize of output 7 [2022-07-21 01:59:31,852 INFO L356 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-07-21 01:59:31,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 82 [2022-07-21 01:59:31,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-07-21 01:59:31,910 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 12 treesize of output 11 [2022-07-21 01:59:31,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-21 01:59:32,068 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1404 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1405) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1404) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$.base|) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)))) is different from true [2022-07-21 01:59:32,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:32,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:32,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:32,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-21 01:59:32,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-21 01:59:32,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-21 01:59:32,293 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_1409 (Array Int Int)) (v_ArrVal_1408 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_1408 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1408) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1409)))) is different from true [2022-07-21 01:59:32,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:32,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:32,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:32,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-07-21 01:59:32,315 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 10 treesize of output 9 [2022-07-21 01:59:32,317 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 23 treesize of output 17 [2022-07-21 01:59:32,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:32,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-21 01:59:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2022-07-21 01:59:32,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:32,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.base_13| Int) (v_ArrVal_1419 (Array Int Int)) (v_ArrVal_1418 (Array Int Int))) (or (not (< |v_chain_node_~node~0#1.base_13| |c_#StackHeapBarrier|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_13| (store v_ArrVal_1419 0 (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_13| v_ArrVal_1419) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_1418) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|) 0)))) is different from false [2022-07-21 01:59:32,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24699155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:32,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:32,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 31 [2022-07-21 01:59:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885345533] [2022-07-21 01:59:32,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:32,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-21 01:59:32,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-21 01:59:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=707, Unknown=21, NotChecked=168, Total=992 [2022-07-21 01:59:32,534 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 7 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 01:59:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:33,505 INFO L93 Difference]: Finished difference Result 181 states and 221 transitions. [2022-07-21 01:59:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 01:59:33,505 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 7 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2022-07-21 01:59:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:33,506 INFO L225 Difference]: With dead ends: 181 [2022-07-21 01:59:33,506 INFO L226 Difference]: Without dead ends: 178 [2022-07-21 01:59:33,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=1374, Unknown=25, NotChecked=234, Total=1806 [2022-07-21 01:59:33,507 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 109 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 496 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:33,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 671 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1073 Invalid, 0 Unknown, 496 Unchecked, 0.6s Time] [2022-07-21 01:59:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-21 01:59:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 128. [2022-07-21 01:59:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 111 states have internal predecessors, (125), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 01:59:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2022-07-21 01:59:33,524 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 49 [2022-07-21 01:59:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:33,525 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2022-07-21 01:59:33,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 7 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 01:59:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2022-07-21 01:59:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 01:59:33,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:33,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:33,573 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 01:59:33,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:33,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2055778686, now seen corresponding path program 1 times [2022-07-21 01:59:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:33,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004317444] [2022-07-21 01:59:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:59:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:33,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 01:59:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:34,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 01:59:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:35,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 01:59:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 01:59:35,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:35,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004317444] [2022-07-21 01:59:35,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004317444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:35,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060315223] [2022-07-21 01:59:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:35,303 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 01:59:35,330 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 01:59:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:35,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-21 01:59:35,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:35,510 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 01:59:35,510 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 23 treesize of output 19 [2022-07-21 01:59:35,634 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 01:59:35,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 01:59:35,645 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 8 treesize of output 7 [2022-07-21 01:59:35,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 01:59:35,781 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-21 01:59:35,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 19 [2022-07-21 01:59:35,785 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 01:59:35,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-21 01:59:36,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 01:59:36,037 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 01:59:36,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:36,086 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 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 01:59:36,780 INFO L356 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2022-07-21 01:59:36,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2022-07-21 01:59:37,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 43 [2022-07-21 01:59:37,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2022-07-21 01:59:37,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:37,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-07-21 01:59:37,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:37,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 16 [2022-07-21 01:59:37,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:37,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 18 [2022-07-21 01:59:37,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 01:59:38,087 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1753 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_1749 (Array Int Int)) (v_ArrVal_1748 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_1748 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1748) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1753)) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_1749 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_1749) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 01:59:38,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,164 INFO L356 Elim1Store]: treesize reduction 52, result has 8.8 percent of original size [2022-07-21 01:59:38,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 89 [2022-07-21 01:59:38,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:38,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2022-07-21 01:59:38,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 01:59:38,196 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 12 treesize of output 11 [2022-07-21 01:59:38,201 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 10 treesize of output 9 [2022-07-21 01:59:38,206 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 74 treesize of output 56 [2022-07-21 01:59:38,215 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 01:59:38,215 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 15 treesize of output 15 [2022-07-21 01:59:40,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:40,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 01:59:40,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 01:59:40,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 77 [2022-07-21 01:59:40,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:40,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:40,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:40,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:40,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 01:59:40,110 INFO L356 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2022-07-21 01:59:40,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 36 [2022-07-21 01:59:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-21 01:59:40,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:59:45,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1778 (Array Int Int)) (v_ArrVal_1777 (Array Int Int)) (|v_chain_node_~node~0#1.base_17| Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_17| (store v_ArrVal_1778 0 (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_17| v_ArrVal_1778) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_1779))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_17| (store v_ArrVal_1777 0 (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_17| v_ArrVal_1777) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0)))) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (or (not (< |v_chain_node_~node~0#1.base_17| |c_#StackHeapBarrier|)) (not (= (select .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|))) (let ((.cse5 (+ .cse1 4))) (and (= (select (select .cse3 .cse4) .cse5) 0) (= (select .cse0 .cse5) 0))) (not (= 0 (select |c_#valid| |v_chain_node_~node~0#1.base_17|)))))))) is different from false [2022-07-21 01:59:45,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060315223] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:45,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:59:45,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 38 [2022-07-21 01:59:45,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854841427] [2022-07-21 01:59:45,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:59:45,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-21 01:59:45,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 01:59:45,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-21 01:59:45,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1648, Unknown=2, NotChecked=166, Total=1980 [2022-07-21 01:59:45,686 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand has 38 states, 32 states have (on average 2.46875) internal successors, (79), 34 states have internal predecessors, (79), 8 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-21 01:59:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:59:56,652 INFO L93 Difference]: Finished difference Result 150 states and 177 transitions. [2022-07-21 01:59:56,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 01:59:56,652 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 32 states have (on average 2.46875) internal successors, (79), 34 states have internal predecessors, (79), 8 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 50 [2022-07-21 01:59:56,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:59:56,654 INFO L225 Difference]: With dead ends: 150 [2022-07-21 01:59:56,654 INFO L226 Difference]: Without dead ends: 147 [2022-07-21 01:59:56,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=291, Invalid=2795, Unknown=2, NotChecked=218, Total=3306 [2022-07-21 01:59:56,655 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 63 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 478 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 01:59:56,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1095 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1180 Invalid, 0 Unknown, 478 Unchecked, 0.8s Time] [2022-07-21 01:59:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-21 01:59:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2022-07-21 01:59:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 113 states have internal predecessors, (128), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-21 01:59:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2022-07-21 01:59:56,666 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 50 [2022-07-21 01:59:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:59:56,666 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2022-07-21 01:59:56,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 32 states have (on average 2.46875) internal successors, (79), 34 states have internal predecessors, (79), 8 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-21 01:59:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2022-07-21 01:59:56,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 01:59:56,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:59:56,667 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:59:56,685 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 01:59:56,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:56,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:59:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:59:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1969592115, now seen corresponding path program 1 times [2022-07-21 01:59:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:59:56,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820469959] [2022-07-21 01:59:56,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:56,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:59:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 01:59:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:57,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 01:59:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:58,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 01:59:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:59,494 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 01:59:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 01:59:59,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820469959] [2022-07-21 01:59:59,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820469959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 01:59:59,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101247253] [2022-07-21 01:59:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:59:59,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 01:59:59,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:59:59,496 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 01:59:59,497 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 01:59:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:59:59,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 189 conjunts are in the unsatisfiable core [2022-07-21 01:59:59,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:59:59,716 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 01:59:59,716 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 23 treesize of output 19 [2022-07-21 01:59:59,826 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 01:59:59,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 01:59:59,848 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 01:59:59,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 01:59:59,854 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 8 treesize of output 7 [2022-07-21 01:59:59,859 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 8 treesize of output 7 [2022-07-21 01:59:59,865 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 8 treesize of output 7 [2022-07-21 01:59:59,870 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 12 treesize of output 11 [2022-07-21 01:59:59,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2022-07-21 01:59:59,931 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 01:59:59,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-07-21 01:59:59,950 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 9 treesize of output 7 [2022-07-21 02:00:00,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-21 02:00:00,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 02:00:00,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-07-21 02:00:00,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:00:00,406 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:00:00,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-07-21 02:00:00,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-21 02:00:00,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-21 02:00:00,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:00:00,769 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 16 treesize of output 15 [2022-07-21 02:00:00,773 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 12 treesize of output 11 [2022-07-21 02:00:00,982 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-21 02:00:00,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 54 [2022-07-21 02:00:00,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:00,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-07-21 02:00:01,113 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:00:01,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 29 [2022-07-21 02:00:01,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 02:00:01,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:00:01,366 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2114 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_2112 (Array Int Int)) (v_ArrVal_2110 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2114) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2112)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_2110 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2110) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)))) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:00:01,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,411 INFO L356 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2022-07-21 02:00:01,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 88 [2022-07-21 02:00:01,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:01,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 58 [2022-07-21 02:00:01,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-21 02:00:01,439 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 9 treesize of output 7 [2022-07-21 02:00:01,444 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 8 treesize of output 7 [2022-07-21 02:00:01,454 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-21 02:00:01,454 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 15 treesize of output 15 [2022-07-21 02:00:02,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:02,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:02,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:02,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:02,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:02,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:02,605 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:00:02,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 39 [2022-07-21 02:00:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-21 02:00:02,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:03,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.base_20| Int) (v_ArrVal_2135 (Array Int Int)) (v_ArrVal_2134 (Array Int Int)) (v_ArrVal_2133 (Array Int Int))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_20| (store v_ArrVal_2133 0 (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_20| v_ArrVal_2133) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse6 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0)))) (.cse1 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_20| v_ArrVal_2134) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_2135))) (let ((.cse4 (select (select .cse1 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse5 (select (select .cse2 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse4) .cse5)) (.cse3 (select (select .cse2 .cse4) .cse5))) (or (not (< |v_chain_node_~node~0#1.base_20| |c_#StackHeapBarrier|)) (and (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|)) (= (select (select .cse2 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) .cse3)) (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_20|) 0)) (not (= (select (select .cse1 .cse0) .cse3) 0))))))) is different from false [2022-07-21 02:00:03,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101247253] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:03,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:00:03,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 40 [2022-07-21 02:00:03,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369670452] [2022-07-21 02:00:03,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:03,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 02:00:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:03,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 02:00:03,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1926, Unknown=4, NotChecked=178, Total=2256 [2022-07-21 02:00:03,230 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand has 40 states, 32 states have (on average 2.28125) internal successors, (73), 35 states have internal predecessors, (73), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:00:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:04,722 INFO L93 Difference]: Finished difference Result 234 states and 284 transitions. [2022-07-21 02:00:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 02:00:04,722 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 32 states have (on average 2.28125) internal successors, (73), 35 states have internal predecessors, (73), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 50 [2022-07-21 02:00:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:04,723 INFO L225 Difference]: With dead ends: 234 [2022-07-21 02:00:04,723 INFO L226 Difference]: Without dead ends: 164 [2022-07-21 02:00:04,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=223, Invalid=2751, Unknown=4, NotChecked=214, Total=3192 [2022-07-21 02:00:04,725 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 54 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 386 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:04,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 969 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 785 Invalid, 0 Unknown, 386 Unchecked, 0.8s Time] [2022-07-21 02:00:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-21 02:00:04,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2022-07-21 02:00:04,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 126 states have (on average 1.1984126984126984) internal successors, (151), 134 states have internal predecessors, (151), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-21 02:00:04,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2022-07-21 02:00:04,738 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 50 [2022-07-21 02:00:04,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:04,739 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2022-07-21 02:00:04,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 32 states have (on average 2.28125) internal successors, (73), 35 states have internal predecessors, (73), 9 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-21 02:00:04,739 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2022-07-21 02:00:04,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 02:00:04,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:04,740 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:00:04,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-21 02:00:04,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:04,955 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1872718035, now seen corresponding path program 1 times [2022-07-21 02:00:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:04,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814312905] [2022-07-21 02:00:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:05,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:00:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:00:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:00:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:05,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 02:00:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-21 02:00:05,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814312905] [2022-07-21 02:00:05,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814312905] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:05,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087312901] [2022-07-21 02:00:05,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:05,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:05,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:05,600 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:00:05,601 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:00:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:05,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 128 conjunts are in the unsatisfiable core [2022-07-21 02:00:05,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:05,935 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:00:05,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:00:05,939 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 8 treesize of output 7 [2022-07-21 02:00:05,948 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 12 treesize of output 11 [2022-07-21 02:00:05,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-21 02:00:05,965 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 9 treesize of output 7 [2022-07-21 02:00:06,095 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:00:06,095 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2022-07-21 02:00:06,149 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:06,149 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 20 treesize of output 8 [2022-07-21 02:00:06,256 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2524 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2524) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2527) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|))) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)))) is different from true [2022-07-21 02:00:06,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,291 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-21 02:00:06,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-07-21 02:00:06,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2022-07-21 02:00:06,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2022-07-21 02:00:06,445 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-21 02:00:06,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 45 [2022-07-21 02:00:06,522 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-21 02:00:06,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 31 [2022-07-21 02:00:06,580 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2533 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2534) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2533) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 02:00:06,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,632 INFO L356 Elim1Store]: treesize reduction 47, result has 44.7 percent of original size [2022-07-21 02:00:06,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 75 [2022-07-21 02:00:06,681 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 19 treesize of output 13 [2022-07-21 02:00:06,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-07-21 02:00:06,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-21 02:00:06,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:06,808 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 24 treesize of output 20 [2022-07-21 02:00:06,906 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2535 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_2535 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2535) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|))) |c_#memory_$Pointer$.base|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (not (= |chain_node_~node~0#1.base| 0)))) is different from true [2022-07-21 02:00:06,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:06,939 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-07-21 02:00:06,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 62 [2022-07-21 02:00:06,944 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 10 treesize of output 9 [2022-07-21 02:00:06,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2022-07-21 02:00:07,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2022-07-21 02:00:07,189 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-21 02:00:07,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 47 [2022-07-21 02:00:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2022-07-21 02:00:07,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:07,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087312901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:07,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:00:07,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 32 [2022-07-21 02:00:07,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395313037] [2022-07-21 02:00:07,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:07,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-21 02:00:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-21 02:00:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=12, NotChecked=174, Total=1056 [2022-07-21 02:00:07,358 INFO L87 Difference]: Start difference. First operand 156 states and 186 transitions. Second operand has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 29 states have internal predecessors, (59), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-21 02:00:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:08,195 INFO L93 Difference]: Finished difference Result 172 states and 205 transitions. [2022-07-21 02:00:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 02:00:08,196 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 29 states have internal predecessors, (59), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 51 [2022-07-21 02:00:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:08,197 INFO L225 Difference]: With dead ends: 172 [2022-07-21 02:00:08,197 INFO L226 Difference]: Without dead ends: 169 [2022-07-21 02:00:08,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=1449, Unknown=16, NotChecked=240, Total=1892 [2022-07-21 02:00:08,198 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 142 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 512 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:08,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 720 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 842 Invalid, 0 Unknown, 512 Unchecked, 0.4s Time] [2022-07-21 02:00:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-21 02:00:08,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2022-07-21 02:00:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 134 states have internal predecessors, (150), 22 states have call successors, (22), 9 states have call predecessors, (22), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-21 02:00:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 185 transitions. [2022-07-21 02:00:08,210 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 185 transitions. Word has length 51 [2022-07-21 02:00:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:08,210 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 185 transitions. [2022-07-21 02:00:08,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 29 states have internal predecessors, (59), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-21 02:00:08,211 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 185 transitions. [2022-07-21 02:00:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-21 02:00:08,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:08,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:00:08,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-21 02:00:08,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:08,426 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1808852267, now seen corresponding path program 1 times [2022-07-21 02:00:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:08,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044364246] [2022-07-21 02:00:08,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:08,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:00:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:08,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:00:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:10,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:00:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:11,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 02:00:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 02:00:11,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:11,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044364246] [2022-07-21 02:00:11,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044364246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:11,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980202016] [2022-07-21 02:00:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:11,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:11,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:11,830 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:11,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 02:00:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:12,085 WARN L261 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 234 conjunts are in the unsatisfiable core [2022-07-21 02:00:12,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:12,142 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-21 02:00:12,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2022-07-21 02:00:12,212 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 7 treesize of output 3 [2022-07-21 02:00:12,215 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 7 treesize of output 3 [2022-07-21 02:00:12,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:00:14,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-07-21 02:00:14,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-21 02:00:14,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 25 [2022-07-21 02:00:14,178 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 20 treesize of output 25 [2022-07-21 02:00:14,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-21 02:00:14,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-07-21 02:00:14,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-07-21 02:00:14,449 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-21 02:00:14,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 61 [2022-07-21 02:00:14,607 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:14,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 32 [2022-07-21 02:00:14,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-21 02:00:14,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,618 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:00:14,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2022-07-21 02:00:14,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,888 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-21 02:00:14,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 69 [2022-07-21 02:00:14,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:00:14,902 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 12 treesize of output 11 [2022-07-21 02:00:14,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2022-07-21 02:00:14,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:14,926 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-21 02:00:14,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2022-07-21 02:00:14,933 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 12 treesize of output 11 [2022-07-21 02:00:15,197 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-07-21 02:00:15,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 147 treesize of output 93 [2022-07-21 02:00:15,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,218 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:00:15,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 78 [2022-07-21 02:00:15,410 INFO L356 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-07-21 02:00:15,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 139 treesize of output 57 [2022-07-21 02:00:15,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,428 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:15,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2022-07-21 02:00:15,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 02:00:15,587 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2894) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2892) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_2891 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2891) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2893) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:00:15,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,656 INFO L356 Elim1Store]: treesize reduction 110, result has 9.1 percent of original size [2022-07-21 02:00:15,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 203 treesize of output 149 [2022-07-21 02:00:15,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,686 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:15,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 76 [2022-07-21 02:00:15,697 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 20 treesize of output 16 [2022-07-21 02:00:15,705 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 12 treesize of output 11 [2022-07-21 02:00:15,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:15,720 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-21 02:00:15,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2022-07-21 02:00:15,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2022-07-21 02:00:18,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:18,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:18,239 INFO L356 Elim1Store]: treesize reduction 215, result has 6.5 percent of original size [2022-07-21 02:00:18,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 26 case distinctions, treesize of input 249 treesize of output 126 [2022-07-21 02:00:18,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:18,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:18,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:18,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:18,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:18,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:18,261 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-21 02:00:18,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 36 [2022-07-21 02:00:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2022-07-21 02:00:18,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:20,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.base_27| Int) (v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2917 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_27| v_ArrVal_2917) |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_27| v_ArrVal_2919) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0))) (.cse0 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_27| (store v_ArrVal_2920 0 (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_27| v_ArrVal_2920) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_2918))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|)) (.cse5 (select (select .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse6 (select (select .cse3 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|))) (or (let ((.cse2 (+ .cse4 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0))) (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_27|) 0)) (not (= .cse1 (select (select .cse0 .cse5) .cse6))) (not (< |v_chain_node_~node~0#1.base_27| |c_#StackHeapBarrier|)) (not (= (select (select .cse3 .cse5) .cse6) .cse4)))))) is different from false [2022-07-21 02:00:20,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980202016] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:20,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:00:20,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25] total 40 [2022-07-21 02:00:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740544034] [2022-07-21 02:00:20,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:20,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 02:00:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 02:00:20,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1804, Unknown=9, NotChecked=174, Total=2162 [2022-07-21 02:00:20,324 INFO L87 Difference]: Start difference. First operand 156 states and 185 transitions. Second operand has 40 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 37 states have internal predecessors, (83), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 02:00:22,488 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_2894 (Array Int Int)) (v_ArrVal_2893 (Array Int Int)) (v_ArrVal_2892 (Array Int Int)) (v_ArrVal_2891 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2894) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2892) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_2891 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2891) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2893) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_2861 (Array Int Int)) (v_ArrVal_2856 Int) (v_ArrVal_2857 Int)) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (let ((.cse1 (store (store (select |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base|) 0 v_ArrVal_2857) 4 0))) (store .cse1 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| .cse1) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)))) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (let ((.cse2 (store (store (select |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base|) 0 v_ArrVal_2856) 4 0))) (store .cse2 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| .cse2) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)))) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2861) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0)))) is different from true [2022-07-21 02:00:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:26,616 INFO L93 Difference]: Finished difference Result 237 states and 287 transitions. [2022-07-21 02:00:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 02:00:26,616 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 37 states have internal predecessors, (83), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 53 [2022-07-21 02:00:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:26,620 INFO L225 Difference]: With dead ends: 237 [2022-07-21 02:00:26,620 INFO L226 Difference]: Without dead ends: 234 [2022-07-21 02:00:26,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=295, Invalid=3008, Unknown=15, NotChecked=342, Total=3660 [2022-07-21 02:00:26,621 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 101 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 666 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:26,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1038 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1065 Invalid, 0 Unknown, 666 Unchecked, 1.0s Time] [2022-07-21 02:00:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-07-21 02:00:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 215. [2022-07-21 02:00:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 183 states have internal predecessors, (205), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-21 02:00:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 262 transitions. [2022-07-21 02:00:26,650 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 262 transitions. Word has length 53 [2022-07-21 02:00:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:26,651 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 262 transitions. [2022-07-21 02:00:26,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 37 states have internal predecessors, (83), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 02:00:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 262 transitions. [2022-07-21 02:00:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 02:00:26,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:26,652 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:00:26,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:26,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-21 02:00:26,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:26,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash 830072921, now seen corresponding path program 1 times [2022-07-21 02:00:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:26,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89460047] [2022-07-21 02:00:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:00:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:27,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:00:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:27,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:00:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 02:00:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:00:29,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:29,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89460047] [2022-07-21 02:00:29,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89460047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:29,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18428230] [2022-07-21 02:00:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:29,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:29,766 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:29,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 02:00:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:30,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 176 conjunts are in the unsatisfiable core [2022-07-21 02:00:30,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:30,055 INFO L356 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-07-21 02:00:30,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 27 [2022-07-21 02:00:30,132 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:30,132 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 7 [2022-07-21 02:00:30,283 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:00:30,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:00:30,288 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 8 treesize of output 7 [2022-07-21 02:00:30,292 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 12 treesize of output 11 [2022-07-21 02:00:30,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:30,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-21 02:00:30,323 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 9 treesize of output 7 [2022-07-21 02:00:30,421 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:00:30,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 26 [2022-07-21 02:00:30,552 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 24 treesize of output 24 [2022-07-21 02:00:30,706 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 18 treesize of output 10 [2022-07-21 02:00:30,711 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:30,711 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 7 [2022-07-21 02:00:30,953 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:00:30,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:00:30,959 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 8 treesize of output 7 [2022-07-21 02:00:30,964 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 8 treesize of output 7 [2022-07-21 02:00:30,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2022-07-21 02:00:30,984 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:00:31,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,145 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 39 treesize of output 32 [2022-07-21 02:00:31,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-07-21 02:00:31,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,167 INFO L356 Elim1Store]: treesize reduction 34, result has 29.2 percent of original size [2022-07-21 02:00:31,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 37 [2022-07-21 02:00:31,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-21 02:00:31,360 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 18 [2022-07-21 02:00:31,373 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 02:00:31,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 46 [2022-07-21 02:00:31,473 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:00:31,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 28 [2022-07-21 02:00:31,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:00:31,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,486 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:31,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 02:00:31,741 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3330 (Array Int Int)) (|chain_node_~ppnode#1.offset| Int) (v_ArrVal_3332 (Array Int Int)) (v_ArrVal_3333 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_3337 (Array Int Int)) (|chain_node_~node~0#1.offset| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_3337) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3333)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_3330 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3330) |c_chain_node_#in~ppnode#1.base|) |chain_node_~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3332)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:00:31,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,787 INFO L356 Elim1Store]: treesize reduction 52, result has 8.8 percent of original size [2022-07-21 02:00:31,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 71 [2022-07-21 02:00:31,797 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:31,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2022-07-21 02:00:31,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-21 02:00:31,809 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 8 treesize of output 7 [2022-07-21 02:00:31,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:31,833 INFO L356 Elim1Store]: treesize reduction 88, result has 32.8 percent of original size [2022-07-21 02:00:31,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 65 [2022-07-21 02:00:32,062 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:32,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 33 [2022-07-21 02:00:32,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,088 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:32,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2022-07-21 02:00:32,094 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 7 treesize of output 3 [2022-07-21 02:00:32,287 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3340 (Array Int Int)) (|chain_node_~ppnode#1.offset| Int) (v_ArrVal_3341 (Array Int Int)) (v_ArrVal_3343 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_3347 (Array Int Int)) (|chain_node_~node~0#1.offset| Int)) (and (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_3340 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_3340) |c_chain_node_#in~ppnode#1.base|) |chain_node_~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3347) |c_#memory_$Pointer$.offset|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3341) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3343) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:00:32,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-21 02:00:32,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,355 INFO L356 Elim1Store]: treesize reduction 39, result has 11.4 percent of original size [2022-07-21 02:00:32,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 80 [2022-07-21 02:00:32,362 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 10 treesize of output 8 [2022-07-21 02:00:32,366 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 8 treesize of output 7 [2022-07-21 02:00:32,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:32,388 INFO L356 Elim1Store]: treesize reduction 28, result has 47.2 percent of original size [2022-07-21 02:00:32,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 40 [2022-07-21 02:00:32,489 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 15 treesize of output 7 [2022-07-21 02:00:32,921 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:32,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 20 [2022-07-21 02:00:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2022-07-21 02:00:32,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:00:33,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3362 (Array Int Int)) (v_ArrVal_3363 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (|v_chain_node_~node~0#1.base_31| Int) (v_ArrVal_3366 (Array Int Int)) (|v_chain_node_~ppnode#1.offset_30| Int) (|v_chain_node_~node~0#1.offset_29| Int)) (or (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_31| v_ArrVal_3366) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_3362))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_31| (store v_ArrVal_3364 |v_chain_node_~node~0#1.offset_29| (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_31| v_ArrVal_3364) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |v_chain_node_~ppnode#1.offset_30|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_3363) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) 0)) (not (< |v_chain_node_~node~0#1.base_31| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_31|) 0)))) is different from false [2022-07-21 02:00:33,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18428230] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:33,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:00:33,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 51 [2022-07-21 02:00:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607057090] [2022-07-21 02:00:33,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:00:33,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 02:00:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:00:33,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 02:00:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2221, Unknown=5, NotChecked=288, Total=2652 [2022-07-21 02:00:33,023 INFO L87 Difference]: Start difference. First operand 215 states and 262 transitions. Second operand has 51 states, 43 states have (on average 2.0) internal successors, (86), 45 states have internal predecessors, (86), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 02:00:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:00:36,499 INFO L93 Difference]: Finished difference Result 311 states and 378 transitions. [2022-07-21 02:00:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 02:00:36,499 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 2.0) internal successors, (86), 45 states have internal predecessors, (86), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 55 [2022-07-21 02:00:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:00:36,501 INFO L225 Difference]: With dead ends: 311 [2022-07-21 02:00:36,501 INFO L226 Difference]: Without dead ends: 308 [2022-07-21 02:00:36,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=260, Invalid=3779, Unknown=5, NotChecked=378, Total=4422 [2022-07-21 02:00:36,502 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 142 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 2945 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 3982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:00:36,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1982 Invalid, 3982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2945 Invalid, 0 Unknown, 977 Unchecked, 2.1s Time] [2022-07-21 02:00:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-21 02:00:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2022-07-21 02:00:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 213 states have (on average 1.1784037558685445) internal successors, (251), 226 states have internal predecessors, (251), 37 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (29), 23 states have call predecessors, (29), 28 states have call successors, (29) [2022-07-21 02:00:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 317 transitions. [2022-07-21 02:00:36,530 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 317 transitions. Word has length 55 [2022-07-21 02:00:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:00:36,530 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 317 transitions. [2022-07-21 02:00:36,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 2.0) internal successors, (86), 45 states have internal predecessors, (86), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 02:00:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 317 transitions. [2022-07-21 02:00:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 02:00:36,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:00:36,532 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:00:36,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 02:00:36,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-21 02:00:36,748 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:00:36,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:00:36,749 INFO L85 PathProgramCache]: Analyzing trace with hash 992893756, now seen corresponding path program 1 times [2022-07-21 02:00:36,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:00:36,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912232178] [2022-07-21 02:00:36,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:36,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:00:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:00:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:36,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:00:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:00:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:38,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 02:00:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 02:00:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:00:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:00:40,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912232178] [2022-07-21 02:00:40,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912232178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:00:40,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194660454] [2022-07-21 02:00:40,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:00:40,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:00:40,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:00:40,051 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:00:40,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 02:00:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:00:40,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 219 conjunts are in the unsatisfiable core [2022-07-21 02:00:40,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:00:40,479 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:00:40,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:00:40,483 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 8 treesize of output 7 [2022-07-21 02:00:40,487 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 8 treesize of output 7 [2022-07-21 02:00:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-21 02:00:40,543 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:00:40,704 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:00:40,704 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-07-21 02:00:40,770 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:40,771 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 19 treesize of output 7 [2022-07-21 02:00:40,807 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:00:40,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:40,863 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 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:00:41,790 INFO L356 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2022-07-21 02:00:41,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2022-07-21 02:00:43,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,392 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 02:00:43,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 43 [2022-07-21 02:00:43,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,609 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-21 02:00:43,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 56 [2022-07-21 02:00:43,622 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:00:43,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 50 [2022-07-21 02:00:43,726 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:00:43,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 32 [2022-07-21 02:00:43,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,737 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:00:43,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 16 [2022-07-21 02:00:43,741 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:00:43,903 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3780 (Array Int Int)) (v_ArrVal_3782 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (v_ArrVal_3784 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3782) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3784) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_3783) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3780) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:00:43,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,980 INFO L356 Elim1Store]: treesize reduction 62, result has 27.1 percent of original size [2022-07-21 02:00:43,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 83 [2022-07-21 02:00:43,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:43,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:44,031 INFO L356 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2022-07-21 02:00:44,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 79 [2022-07-21 02:00:44,054 INFO L356 Elim1Store]: treesize reduction 24, result has 36.8 percent of original size [2022-07-21 02:00:44,054 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 19 treesize of output 25 [2022-07-21 02:00:44,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-21 02:00:44,089 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:00:44,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2022-07-21 02:00:44,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:44,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:44,467 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:44,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2022-07-21 02:00:44,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:44,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:44,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:00:44,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2022-07-21 02:00:44,481 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:00:50,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,339 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:00:50,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 72 [2022-07-21 02:00:50,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,413 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-07-21 02:00:50,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 82 [2022-07-21 02:00:50,424 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 18 treesize of output 23 [2022-07-21 02:00:50,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:50,466 INFO L356 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-07-21 02:00:50,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 86 [2022-07-21 02:00:50,489 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-21 02:00:50,489 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 28 treesize of output 34 [2022-07-21 02:00:55,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:00:55,484 INFO L356 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-07-21 02:00:55,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 196 treesize of output 111 [2022-07-21 02:00:55,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:00:55,509 INFO L356 Elim1Store]: treesize reduction 102, result has 2.9 percent of original size [2022-07-21 02:00:55,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 36 [2022-07-21 02:00:55,516 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-07-21 02:00:55,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:01,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194660454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:01,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:01:01,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 30] total 45 [2022-07-21 02:01:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858470242] [2022-07-21 02:01:01,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:01,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 02:01:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 02:01:01,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2345, Unknown=15, NotChecked=98, Total=2652 [2022-07-21 02:01:01,765 INFO L87 Difference]: Start difference. First operand 263 states and 317 transitions. Second operand has 45 states, 40 states have (on average 2.325) internal successors, (93), 41 states have internal predecessors, (93), 9 states have call successors, (10), 6 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-21 02:01:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:15,069 INFO L93 Difference]: Finished difference Result 313 states and 376 transitions. [2022-07-21 02:01:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-21 02:01:15,069 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.325) internal successors, (93), 41 states have internal predecessors, (93), 9 states have call successors, (10), 6 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 59 [2022-07-21 02:01:15,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:15,071 INFO L225 Difference]: With dead ends: 313 [2022-07-21 02:01:15,071 INFO L226 Difference]: Without dead ends: 310 [2022-07-21 02:01:15,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=381, Invalid=4436, Unknown=17, NotChecked=136, Total=4970 [2022-07-21 02:01:15,072 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 120 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 712 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:15,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1128 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 930 Invalid, 0 Unknown, 712 Unchecked, 0.8s Time] [2022-07-21 02:01:15,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-21 02:01:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 294. [2022-07-21 02:01:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 238 states have (on average 1.1722689075630253) internal successors, (279), 253 states have internal predecessors, (279), 41 states have call successors, (41), 15 states have call predecessors, (41), 14 states have return successors, (34), 25 states have call predecessors, (34), 32 states have call successors, (34) [2022-07-21 02:01:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 354 transitions. [2022-07-21 02:01:15,100 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 354 transitions. Word has length 59 [2022-07-21 02:01:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:15,100 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 354 transitions. [2022-07-21 02:01:15,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.325) internal successors, (93), 41 states have internal predecessors, (93), 9 states have call successors, (10), 6 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2022-07-21 02:01:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 354 transitions. [2022-07-21 02:01:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 02:01:15,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:15,101 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:15,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-21 02:01:15,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-21 02:01:15,320 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:15,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:15,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1079080327, now seen corresponding path program 1 times [2022-07-21 02:01:15,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:15,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069980986] [2022-07-21 02:01:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:01:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:15,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:01:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:01:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 02:01:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:01:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:19,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069980986] [2022-07-21 02:01:19,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069980986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:19,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266690420] [2022-07-21 02:01:19,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:19,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:19,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:19,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:01:19,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 02:01:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:20,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 217 conjunts are in the unsatisfiable core [2022-07-21 02:01:20,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:20,111 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:01:20,111 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 23 treesize of output 19 [2022-07-21 02:01:20,218 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:01:20,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:01:20,239 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:01:20,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:01:20,244 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 8 treesize of output 7 [2022-07-21 02:01:20,249 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 8 treesize of output 7 [2022-07-21 02:01:20,254 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 8 treesize of output 7 [2022-07-21 02:01:20,259 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 12 treesize of output 11 [2022-07-21 02:01:20,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:01:20,320 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2022-07-21 02:01:20,323 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:01:20,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-07-21 02:01:20,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-07-21 02:01:20,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-21 02:01:20,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2022-07-21 02:01:20,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:01:20,786 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:01:21,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-07-21 02:01:21,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-21 02:01:21,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:01:21,185 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 16 treesize of output 15 [2022-07-21 02:01:21,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:01:21,194 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 12 treesize of output 11 [2022-07-21 02:01:21,387 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-21 02:01:21,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 50 [2022-07-21 02:01:21,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-07-21 02:01:21,516 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:01:21,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 25 [2022-07-21 02:01:21,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 02:01:21,526 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:01:21,764 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4240 (Array Int Int)) (v_ArrVal_4241 (Array Int Int)) (|chain_node_~ppnode#1.offset| Int) (v_ArrVal_4243 (Array Int Int)) (v_ArrVal_4247 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|chain_node_~node~0#1.offset| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_4240 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_4240) |c_chain_node_#in~ppnode#1.base|) |chain_node_~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_4247)) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_4241 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_4241) |c_chain_node_#in~ppnode#1.base|) |chain_node_~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_4243)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:01:21,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2022-07-21 02:01:21,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:21,819 INFO L356 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2022-07-21 02:01:21,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 71 [2022-07-21 02:01:21,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:21,830 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 54 treesize of output 50 [2022-07-21 02:01:21,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:01:21,841 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 16 treesize of output 20 [2022-07-21 02:01:21,860 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-21 02:01:21,860 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 21 treesize of output 29 [2022-07-21 02:01:21,867 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 8 treesize of output 7 [2022-07-21 02:01:21,873 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 8 treesize of output 7 [2022-07-21 02:01:22,148 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:01:22,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 26 [2022-07-21 02:01:22,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-21 02:01:22,158 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:01:22,373 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4262 (Array Int Int)) (v_ArrVal_4252 (Array Int Int)) (v_ArrVal_4258 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_4260 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_4252 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_4252) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_4258)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_4260) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_4262) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:01:22,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,425 INFO L356 Elim1Store]: treesize reduction 60, result has 7.7 percent of original size [2022-07-21 02:01:22,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 86 [2022-07-21 02:01:22,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:22,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2022-07-21 02:01:22,461 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-21 02:01:22,461 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 20 treesize of output 22 [2022-07-21 02:01:22,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 02:01:22,472 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 9 treesize of output 7 [2022-07-21 02:01:22,478 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 8 treesize of output 7 [2022-07-21 02:01:23,373 INFO L356 Elim1Store]: treesize reduction 33, result has 8.3 percent of original size [2022-07-21 02:01:23,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 49 [2022-07-21 02:01:23,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:23,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:23,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:23,384 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:01:23,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 25 [2022-07-21 02:01:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 10 not checked. [2022-07-21 02:01:23,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:23,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.base_38| Int) (v_ArrVal_4280 (Array Int Int)) (v_ArrVal_4281 (Array Int Int)) (v_ArrVal_4282 (Array Int Int)) (v_ArrVal_4283 (Array Int Int))) (or (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_38|) 0)) (not (< |v_chain_node_~node~0#1.base_38| |c_#StackHeapBarrier|)) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_38| v_ArrVal_4282) |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_38| v_ArrVal_4280) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0))) (.cse0 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_38| (store v_ArrVal_4283 0 (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_38| v_ArrVal_4283) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_4281))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (and (= (select (select .cse0 .cse1) .cse2) (select (select .cse0 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|)) (= (select (select .cse3 .cse1) .cse2) (select (select .cse3 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|))))))) is different from false [2022-07-21 02:01:23,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266690420] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:23,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:01:23,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2022-07-21 02:01:23,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732112164] [2022-07-21 02:01:23,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:23,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-21 02:01:23,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:23,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-21 02:01:23,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2377, Unknown=8, NotChecked=300, Total=2862 [2022-07-21 02:01:23,829 INFO L87 Difference]: Start difference. First operand 294 states and 354 transitions. Second operand has 48 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 43 states have internal predecessors, (89), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-21 02:01:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:26,880 INFO L93 Difference]: Finished difference Result 417 states and 502 transitions. [2022-07-21 02:01:26,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 02:01:26,881 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 43 states have internal predecessors, (89), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 59 [2022-07-21 02:01:26,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:26,882 INFO L225 Difference]: With dead ends: 417 [2022-07-21 02:01:26,882 INFO L226 Difference]: Without dead ends: 340 [2022-07-21 02:01:26,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=341, Invalid=4085, Unknown=8, NotChecked=396, Total=4830 [2022-07-21 02:01:26,884 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 170 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 717 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:26,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1244 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1945 Invalid, 0 Unknown, 717 Unchecked, 1.5s Time] [2022-07-21 02:01:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-07-21 02:01:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 267. [2022-07-21 02:01:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 214 states have (on average 1.1682242990654206) internal successors, (250), 228 states have internal predecessors, (250), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (31), 24 states have call predecessors, (31), 30 states have call successors, (31) [2022-07-21 02:01:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 320 transitions. [2022-07-21 02:01:26,917 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 320 transitions. Word has length 59 [2022-07-21 02:01:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:26,917 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 320 transitions. [2022-07-21 02:01:26,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 43 states have internal predecessors, (89), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-21 02:01:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 320 transitions. [2022-07-21 02:01:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 02:01:26,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:26,918 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:26,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 02:01:27,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 02:01:27,137 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:27,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:27,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1740102043, now seen corresponding path program 1 times [2022-07-21 02:01:27,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:27,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353808070] [2022-07-21 02:01:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:01:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:01:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:27,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 02:01:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 02:01:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-21 02:01:29,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353808070] [2022-07-21 02:01:29,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353808070] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:29,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757837277] [2022-07-21 02:01:29,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:29,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:29,546 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:01:29,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 02:01:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:29,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 253 conjunts are in the unsatisfiable core [2022-07-21 02:01:29,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:29,881 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:01:29,881 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 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-21 02:01:29,961 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:01:30,149 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:01:30,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:01:30,173 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:01:30,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:01:30,178 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 8 treesize of output 7 [2022-07-21 02:01:30,184 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 8 treesize of output 7 [2022-07-21 02:01:30,189 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 12 treesize of output 11 [2022-07-21 02:01:30,194 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 8 treesize of output 7 [2022-07-21 02:01:30,290 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:01:30,291 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 51 treesize of output 9 [2022-07-21 02:01:30,294 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 9 treesize of output 7 [2022-07-21 02:01:30,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2022-07-21 02:01:30,344 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:01:30,597 INFO L356 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-07-21 02:01:30,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 36 [2022-07-21 02:01:31,014 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:01:31,775 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:01:32,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:01:32,415 INFO L356 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-07-21 02:01:32,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 121 [2022-07-21 02:01:32,453 INFO L356 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2022-07-21 02:01:32,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 82 [2022-07-21 02:01:32,527 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 12 treesize of output 11 [2022-07-21 02:01:32,613 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 12 treesize of output 11 [2022-07-21 02:01:32,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:32,650 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 12 treesize of output 1 [2022-07-21 02:01:32,687 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 12 treesize of output 1 [2022-07-21 02:01:32,725 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 27 treesize of output 19 [2022-07-21 02:01:32,766 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 32 treesize of output 22 [2022-07-21 02:01:32,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-07-21 02:01:32,836 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 27 treesize of output 19 [2022-07-21 02:01:33,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 02:01:33,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-07-21 02:01:33,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-21 02:01:33,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 02:01:33,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 92 [2022-07-21 02:01:33,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 76 [2022-07-21 02:01:33,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2022-07-21 02:01:33,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 77 [2022-07-21 02:01:33,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-21 02:01:33,367 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 12 treesize of output 11 [2022-07-21 02:01:33,689 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:01:33,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 60 [2022-07-21 02:01:33,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-07-21 02:01:33,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-21 02:01:33,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,985 INFO L356 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2022-07-21 02:01:33,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 114 [2022-07-21 02:01:33,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 112 [2022-07-21 02:01:33,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:33,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-07-21 02:01:34,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:01:34,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,029 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-21 02:01:34,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 121 [2022-07-21 02:01:34,037 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 12 treesize of output 11 [2022-07-21 02:01:34,042 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 12 treesize of output 11 [2022-07-21 02:01:34,400 INFO L356 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-07-21 02:01:34,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 227 treesize of output 117 [2022-07-21 02:01:34,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-07-21 02:01:34,594 INFO L356 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-07-21 02:01:34,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 223 treesize of output 85 [2022-07-21 02:01:34,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2022-07-21 02:01:34,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 02:01:34,823 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_4724 (Array Int Int)) (v_ArrVal_4714 (Array Int Int)) (v_ArrVal_4716 (Array Int Int)) (v_ArrVal_4717 (Array Int Int))) (and (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_4724) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_4717) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_4714 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_4714) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_4716) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:01:34,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,919 INFO L356 Elim1Store]: treesize reduction 126, result has 8.0 percent of original size [2022-07-21 02:01:34,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 287 treesize of output 194 [2022-07-21 02:01:34,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2022-07-21 02:01:34,943 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 243 treesize of output 203 [2022-07-21 02:01:34,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:34,962 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-21 02:01:34,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 160 [2022-07-21 02:01:34,985 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 12 treesize of output 11 [2022-07-21 02:01:34,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2022-07-21 02:01:36,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:36,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:36,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:36,267 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-21 02:01:36,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 36 [2022-07-21 02:01:36,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:36,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:36,571 INFO L356 Elim1Store]: treesize reduction 48, result has 15.8 percent of original size [2022-07-21 02:01:36,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 134 treesize of output 56 [2022-07-21 02:01:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 6 not checked. [2022-07-21 02:01:36,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:37,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4742 (Array Int Int)) (v_ArrVal_4743 (Array Int Int)) (|v_chain_node_~node~0#1.base_41| Int) (v_ArrVal_4744 (Array Int Int)) (v_ArrVal_4745 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_41| v_ArrVal_4742) |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_41| v_ArrVal_4744) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0))) (.cse0 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_41| (store v_ArrVal_4745 0 (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_41| v_ArrVal_4745) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_4743))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_41|) 0)) (not (< |v_chain_node_~node~0#1.base_41| |c_#StackHeapBarrier|)) (and (= (select (select .cse0 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) .cse1) (= (select (select .cse3 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) .cse2))))))) is different from false [2022-07-21 02:01:37,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757837277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:37,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:01:37,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 51 [2022-07-21 02:01:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914146927] [2022-07-21 02:01:37,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:37,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 02:01:37,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 02:01:37,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2809, Unknown=11, NotChecked=214, Total=3192 [2022-07-21 02:01:37,187 INFO L87 Difference]: Start difference. First operand 267 states and 320 transitions. Second operand has 51 states, 43 states have (on average 2.116279069767442) internal successors, (91), 46 states have internal predecessors, (91), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 02:01:40,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:40,242 INFO L93 Difference]: Finished difference Result 341 states and 420 transitions. [2022-07-21 02:01:40,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-21 02:01:40,243 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 2.116279069767442) internal successors, (91), 46 states have internal predecessors, (91), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 59 [2022-07-21 02:01:40,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:40,245 INFO L225 Difference]: With dead ends: 341 [2022-07-21 02:01:40,245 INFO L226 Difference]: Without dead ends: 338 [2022-07-21 02:01:40,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=272, Invalid=4417, Unknown=11, NotChecked=270, Total=4970 [2022-07-21 02:01:40,247 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 53 mSDsluCounter, 1698 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 3002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1046 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:40,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1810 Invalid, 3002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1920 Invalid, 0 Unknown, 1046 Unchecked, 1.5s Time] [2022-07-21 02:01:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-21 02:01:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 304. [2022-07-21 02:01:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 244 states have (on average 1.1721311475409837) internal successors, (286), 260 states have internal predecessors, (286), 45 states have call successors, (45), 15 states have call predecessors, (45), 14 states have return successors, (39), 28 states have call predecessors, (39), 36 states have call successors, (39) [2022-07-21 02:01:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 370 transitions. [2022-07-21 02:01:40,284 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 370 transitions. Word has length 59 [2022-07-21 02:01:40,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:40,284 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 370 transitions. [2022-07-21 02:01:40,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 2.116279069767442) internal successors, (91), 46 states have internal predecessors, (91), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 02:01:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 370 transitions. [2022-07-21 02:01:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 02:01:40,285 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:40,285 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:40,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 02:01:40,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-21 02:01:40,504 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:40,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:40,505 INFO L85 PathProgramCache]: Analyzing trace with hash -186573861, now seen corresponding path program 1 times [2022-07-21 02:01:40,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:40,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277834830] [2022-07-21 02:01:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:40,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:01:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:40,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:01:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:42,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:01:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:43,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 02:01:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 02:01:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 02:01:45,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277834830] [2022-07-21 02:01:45,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277834830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:45,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151385700] [2022-07-21 02:01:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:45,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:45,192 INFO L229 MonitoredProcess]: Starting monitored process 14 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:01:45,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 02:01:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:45,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 220 conjunts are in the unsatisfiable core [2022-07-21 02:01:45,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:45,635 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:01:45,635 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 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-21 02:01:47,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-07-21 02:01:47,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-07-21 02:01:47,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-21 02:01:47,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-07-21 02:01:47,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 16 treesize of output 17 [2022-07-21 02:01:47,452 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 16 treesize of output 17 [2022-07-21 02:01:47,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-21 02:01:47,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-21 02:01:47,475 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-21 02:01:47,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-21 02:01:47,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2022-07-21 02:01:47,687 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-21 02:01:47,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 64 [2022-07-21 02:01:47,809 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:01:47,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 39 [2022-07-21 02:01:47,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 02:01:47,817 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 02:01:47,946 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5154 (Array Int Int)) (v_ArrVal_5155 (Array Int Int)) (v_ArrVal_5166 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|chain_node_~node~0#1.offset| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_5154 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5154) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)))) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_5155 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5155) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5166)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:01:47,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:47,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2022-07-21 02:01:47,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,013 INFO L356 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2022-07-21 02:01:48,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 87 [2022-07-21 02:01:48,020 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 16 treesize of output 12 [2022-07-21 02:01:48,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 63 [2022-07-21 02:01:48,031 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 16 treesize of output 15 [2022-07-21 02:01:48,059 INFO L356 Elim1Store]: treesize reduction 64, result has 35.4 percent of original size [2022-07-21 02:01:48,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 53 [2022-07-21 02:01:48,067 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 12 treesize of output 11 [2022-07-21 02:01:48,363 INFO L356 Elim1Store]: treesize reduction 112, result has 11.8 percent of original size [2022-07-21 02:01:48,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 146 treesize of output 107 [2022-07-21 02:01:48,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 49 [2022-07-21 02:01:48,542 INFO L356 Elim1Store]: treesize reduction 92, result has 8.9 percent of original size [2022-07-21 02:01:48,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 142 treesize of output 76 [2022-07-21 02:01:48,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 02:01:48,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 02:01:48,694 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5176 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (|chain_node_~ppnode#1.offset| Int) (|chain_node_~node~0#1.base| Int) (v_ArrVal_5172 (Array Int Int)) (|chain_node_~node~0#1.offset| Int) (v_ArrVal_5173 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5176) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5178)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_5172 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5172) |c_chain_node_#in~ppnode#1.base|) |chain_node_~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5173)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:01:48,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2022-07-21 02:01:48,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:48,775 INFO L356 Elim1Store]: treesize reduction 142, result has 12.3 percent of original size [2022-07-21 02:01:48,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 151 treesize of output 140 [2022-07-21 02:01:48,784 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 10 treesize of output 8 [2022-07-21 02:01:48,789 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 8 treesize of output 7 [2022-07-21 02:01:48,794 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 60 treesize of output 46 [2022-07-21 02:01:48,828 INFO L356 Elim1Store]: treesize reduction 78, result has 36.1 percent of original size [2022-07-21 02:01:48,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2022-07-21 02:01:49,107 INFO L356 Elim1Store]: treesize reduction 69, result has 5.5 percent of original size [2022-07-21 02:01:49,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 147 treesize of output 77 [2022-07-21 02:01:49,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:49,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:49,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-07-21 02:01:49,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-21 02:01:49,216 WARN L855 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int)) (v_ArrVal_5185 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (and (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5185) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5183) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5182) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5184)) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:01:49,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:49,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:49,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:49,294 INFO L356 Elim1Store]: treesize reduction 108, result has 9.2 percent of original size [2022-07-21 02:01:49,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 178 treesize of output 159 [2022-07-21 02:01:49,328 INFO L356 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2022-07-21 02:01:49,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-07-21 02:01:49,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:49,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:49,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:49,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2022-07-21 02:01:50,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:50,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:01:50,209 INFO L356 Elim1Store]: treesize reduction 86, result has 8.5 percent of original size [2022-07-21 02:01:50,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 153 treesize of output 84 [2022-07-21 02:01:50,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:50,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:01:50,222 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-21 02:01:50,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 24 [2022-07-21 02:01:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 12 not checked. [2022-07-21 02:01:50,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:50,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5198 (Array Int Int)) (v_ArrVal_5200 (Array Int Int)) (v_ArrVal_5199 (Array Int Int)) (v_ArrVal_5202 (Array Int Int)) (|v_chain_node_~node~0#1.base_45| Int)) (or (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_45|) 0)) (not (< |v_chain_node_~node~0#1.base_45| |c_#StackHeapBarrier|)) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_45| v_ArrVal_5198) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_5199)) (.cse3 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_45| v_ArrVal_5202) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_5200))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|) 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)))))) is different from false [2022-07-21 02:01:50,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151385700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:50,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:01:50,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 40 [2022-07-21 02:01:50,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971363137] [2022-07-21 02:01:50,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:50,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-21 02:01:50,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:50,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-21 02:01:50,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1241, Unknown=8, NotChecked=300, Total=1722 [2022-07-21 02:01:50,432 INFO L87 Difference]: Start difference. First operand 304 states and 370 transitions. Second operand has 40 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-21 02:01:52,449 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5143 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_5138 Int) (v_ArrVal_5135 Int) (v_ArrVal_5140 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (let ((.cse0 (store (store (select |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base|) 0 v_ArrVal_5138) 4 0))) (store .cse0 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| .cse0) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)))) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5140) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|))) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (let ((.cse1 (store (store (select |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base|) 0 v_ArrVal_5135) 4 0))) (store .cse1 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| .cse1) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|)))) |c_chain_node_#in~ppnode#1.base| (store (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5143) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((v_ArrVal_5154 (Array Int Int)) (v_ArrVal_5155 (Array Int Int)) (v_ArrVal_5166 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (|chain_node_~node~0#1.offset| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= |c_#memory_$Pointer$.base| (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_5154 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5154) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse2 |c_chain_node_#in~ppnode#1.base| (store (select .cse2 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)))) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_5155 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5155) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5166)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_5183 (Array Int Int)) (v_ArrVal_5182 (Array Int Int)) (v_ArrVal_5185 (Array Int Int)) (v_ArrVal_5184 (Array Int Int))) (and (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5185) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5183) |c_#memory_$Pointer$.base|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5182) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5184)) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((v_ArrVal_5176 (Array Int Int)) (v_ArrVal_5178 (Array Int Int)) (|chain_node_~ppnode#1.offset| Int) (|chain_node_~node~0#1.base| Int) (v_ArrVal_5172 (Array Int Int)) (|chain_node_~node~0#1.offset| Int) (v_ArrVal_5173 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5176) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5178)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_5172 |chain_node_~node~0#1.offset| (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5172) |c_chain_node_#in~ppnode#1.base|) |chain_node_~ppnode#1.offset|))) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5173)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0)))) is different from true [2022-07-21 02:01:55,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:55,440 INFO L93 Difference]: Finished difference Result 409 states and 499 transitions. [2022-07-21 02:01:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 02:01:55,440 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 62 [2022-07-21 02:01:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:55,443 INFO L225 Difference]: With dead ends: 409 [2022-07-21 02:01:55,443 INFO L226 Difference]: Without dead ends: 406 [2022-07-21 02:01:55,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=255, Invalid=1916, Unknown=11, NotChecked=470, Total=2652 [2022-07-21 02:01:55,444 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 95 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1106 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:55,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1002 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1132 Invalid, 0 Unknown, 1106 Unchecked, 0.9s Time] [2022-07-21 02:01:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-07-21 02:01:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 336. [2022-07-21 02:01:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 266 states have (on average 1.1917293233082706) internal successors, (317), 283 states have internal predecessors, (317), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (50), 37 states have call predecessors, (50), 46 states have call successors, (50) [2022-07-21 02:01:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 422 transitions. [2022-07-21 02:01:55,507 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 422 transitions. Word has length 62 [2022-07-21 02:01:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:55,507 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 422 transitions. [2022-07-21 02:01:55,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 2.657142857142857) internal successors, (93), 38 states have internal predecessors, (93), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-21 02:01:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 422 transitions. [2022-07-21 02:01:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 02:01:55,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:55,509 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:55,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 02:01:55,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-21 02:01:55,728 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1802853032, now seen corresponding path program 1 times [2022-07-21 02:01:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:55,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144286273] [2022-07-21 02:01:55,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:01:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:55,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:01:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:55,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:01:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:55,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 02:01:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:55,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 02:01:55,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:01:55,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144286273] [2022-07-21 02:01:55,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144286273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:01:55,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873170792] [2022-07-21 02:01:55,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:55,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:55,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:01:55,853 INFO L229 MonitoredProcess]: Starting monitored process 15 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:01:55,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 02:01:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:56,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 02:01:56,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:01:56,243 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 25 treesize of output 17 [2022-07-21 02:01:56,245 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 21 treesize of output 13 [2022-07-21 02:01:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 02:01:56,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:01:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 02:01:56,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873170792] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:01:56,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:01:56,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 12 [2022-07-21 02:01:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480439818] [2022-07-21 02:01:56,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:01:56,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 02:01:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:01:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 02:01:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-07-21 02:01:56,438 INFO L87 Difference]: Start difference. First operand 336 states and 422 transitions. Second operand has 12 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 02:01:56,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:01:56,790 INFO L93 Difference]: Finished difference Result 363 states and 456 transitions. [2022-07-21 02:01:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 02:01:56,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 63 [2022-07-21 02:01:56,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:01:56,792 INFO L225 Difference]: With dead ends: 363 [2022-07-21 02:01:56,792 INFO L226 Difference]: Without dead ends: 360 [2022-07-21 02:01:56,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-21 02:01:56,793 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 92 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:01:56,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 384 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 367 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2022-07-21 02:01:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-21 02:01:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 344. [2022-07-21 02:01:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 273 states have (on average 1.1904761904761905) internal successors, (325), 290 states have internal predecessors, (325), 56 states have call successors, (56), 16 states have call predecessors, (56), 14 states have return successors, (51), 37 states have call predecessors, (51), 47 states have call successors, (51) [2022-07-21 02:01:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 432 transitions. [2022-07-21 02:01:56,842 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 432 transitions. Word has length 63 [2022-07-21 02:01:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:01:56,842 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 432 transitions. [2022-07-21 02:01:56,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.888888888888889) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-21 02:01:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 432 transitions. [2022-07-21 02:01:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 02:01:56,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:01:56,843 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:01:56,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 02:01:57,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:01:57,062 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:01:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:01:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1473312201, now seen corresponding path program 2 times [2022-07-21 02:01:57,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:01:57,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264840157] [2022-07-21 02:01:57,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:01:57,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:01:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:57,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:01:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:01:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:01:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 02:01:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:00,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 02:02:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 02:02:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:02:02,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264840157] [2022-07-21 02:02:02,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264840157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:02:02,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302033717] [2022-07-21 02:02:02,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:02:02,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:02:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:02:02,243 INFO L229 MonitoredProcess]: Starting monitored process 16 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:02:02,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 02:02:02,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:02:02,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:02:02,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 265 conjunts are in the unsatisfiable core [2022-07-21 02:02:02,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:02:02,711 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-21 02:02:02,711 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 4 case distinctions, treesize of input 35 treesize of output 34 [2022-07-21 02:02:02,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-21 02:02:03,258 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:02:03,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:02:03,280 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:02:03,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:02:03,285 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 8 treesize of output 7 [2022-07-21 02:02:03,290 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 12 treesize of output 11 [2022-07-21 02:02:03,295 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 8 treesize of output 7 [2022-07-21 02:02:03,300 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 8 treesize of output 7 [2022-07-21 02:02:03,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-21 02:02:03,338 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 9 treesize of output 7 [2022-07-21 02:02:03,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 15 [2022-07-21 02:02:03,442 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:02:03,883 INFO L356 Elim1Store]: treesize reduction 42, result has 48.8 percent of original size [2022-07-21 02:02:03,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 58 [2022-07-21 02:02:04,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 59 [2022-07-21 02:02:04,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-07-21 02:02:04,284 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:02:04,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2022-07-21 02:02:04,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-07-21 02:02:04,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 02:02:05,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-07-21 02:02:05,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-21 02:02:05,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:02:05,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 50 [2022-07-21 02:02:05,264 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 16 treesize of output 15 [2022-07-21 02:02:05,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 61 [2022-07-21 02:02:05,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 16 treesize of output 15 [2022-07-21 02:02:05,633 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-21 02:02:05,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 53 [2022-07-21 02:02:05,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-07-21 02:02:05,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:05,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-21 02:02:06,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,507 INFO L356 Elim1Store]: treesize reduction 55, result has 8.3 percent of original size [2022-07-21 02:02:06,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 99 [2022-07-21 02:02:06,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2022-07-21 02:02:06,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 46 [2022-07-21 02:02:06,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:02:06,542 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 12 treesize of output 11 [2022-07-21 02:02:06,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,566 INFO L356 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2022-07-21 02:02:06,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 93 [2022-07-21 02:02:06,574 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 12 treesize of output 11 [2022-07-21 02:02:06,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:06,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2022-07-21 02:02:07,022 INFO L356 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-07-21 02:02:07,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 164 treesize of output 110 [2022-07-21 02:02:07,275 INFO L356 Elim1Store]: treesize reduction 56, result has 1.8 percent of original size [2022-07-21 02:02:07,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 160 treesize of output 78 [2022-07-21 02:02:07,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2022-07-21 02:02:07,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-07-21 02:02:07,625 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5940 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5937 (Array Int Int))) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_5932 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5932) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))) |c_#memory_$Pointer$.offset|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5937) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5940) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2022-07-21 02:02:07,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,709 INFO L356 Elim1Store]: treesize reduction 116, result has 8.7 percent of original size [2022-07-21 02:02:07,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 217 treesize of output 176 [2022-07-21 02:02:07,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 74 [2022-07-21 02:02:07,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:07,761 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-21 02:02:07,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 59 [2022-07-21 02:02:07,771 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 137 treesize of output 107 [2022-07-21 02:02:07,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-21 02:02:07,789 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 12 treesize of output 11 [2022-07-21 02:02:11,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:11,126 INFO L356 Elim1Store]: treesize reduction 146, result has 4.6 percent of original size [2022-07-21 02:02:11,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 75 [2022-07-21 02:02:11,408 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2022-07-21 02:02:11,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:02:12,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_chain_node_~node~0#1.base_57| Int) (v_ArrVal_5955 (Array Int Int)) (v_ArrVal_5958 (Array Int Int)) (v_ArrVal_5957 (Array Int Int))) (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_57| (store v_ArrVal_5958 0 (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_57| v_ArrVal_5958) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse10 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0)))) (.cse4 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_57| v_ArrVal_5957) |c_ULTIMATE.start_create_sll_~#list~0#1.base| v_ArrVal_5955))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (select (select .cse7 .cse8) .cse9))) (let ((.cse1 (select (select .cse4 .cse5) .cse6)) (.cse2 (select (select .cse7 .cse5) .cse6)) (.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|)) (.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~#p2~0#1.base|) |c_ULTIMATE.start_main_~#p2~0#1.offset|))) (or (not (= (select |c_#valid| |v_chain_node_~node~0#1.base_57|) 0)) (and (= .cse0 .cse1) (= .cse2 .cse3)) (not (= (select (select .cse4 .cse1) .cse2) 0)) (and (= .cse0 .cse5) (= .cse3 .cse6)) (not (< |v_chain_node_~node~0#1.base_57| |c_#StackHeapBarrier|)))))))) is different from false [2022-07-21 02:02:12,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302033717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:02:12,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:02:12,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 54 [2022-07-21 02:02:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307963682] [2022-07-21 02:02:12,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:02:12,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-21 02:02:12,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:02:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-21 02:02:12,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3539, Unknown=20, NotChecked=242, Total=4032 [2022-07-21 02:02:12,578 INFO L87 Difference]: Start difference. First operand 344 states and 432 transitions. Second operand has 54 states, 46 states have (on average 2.152173913043478) internal successors, (99), 49 states have internal predecessors, (99), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 02:02:12,842 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5940 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5937 (Array Int Int))) (and (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_5932 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5932) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0))) |c_#memory_$Pointer$.offset|) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5937) |c_chain_node_#in~ppnode#1.base| v_ArrVal_5940) |c_#memory_$Pointer$.base|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_5914 (Array Int Int)) (v_ArrVal_5913 (Array Int Int))) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| (store v_ArrVal_5914 0 (select (select (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_5914) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse1 |c_chain_node_#in~ppnode#1.base| (store (select .cse1 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)))) (= |c_#valid| (store |c_old(#valid)| |chain_node_~node~0#1.base| 1)) (not (= |chain_node_~node~0#1.base| 0)) (= |c_#memory_$Pointer$.offset| (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| (store v_ArrVal_5913 0 (select (select (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_5913) |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset|))))) (store .cse2 |c_chain_node_#in~ppnode#1.base| (store (select .cse2 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| 0)))) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0)))) is different from true [2022-07-21 02:02:16,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:02:16,170 INFO L93 Difference]: Finished difference Result 502 states and 624 transitions. [2022-07-21 02:02:16,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-21 02:02:16,171 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 46 states have (on average 2.152173913043478) internal successors, (99), 49 states have internal predecessors, (99), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 63 [2022-07-21 02:02:16,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:02:16,173 INFO L225 Difference]: With dead ends: 502 [2022-07-21 02:02:16,173 INFO L226 Difference]: Without dead ends: 418 [2022-07-21 02:02:16,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=445, Invalid=6024, Unknown=23, NotChecked=480, Total=6972 [2022-07-21 02:02:16,174 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 163 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 2282 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 3806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1430 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 02:02:16,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 2092 Invalid, 3806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2282 Invalid, 0 Unknown, 1430 Unchecked, 2.2s Time] [2022-07-21 02:02:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-21 02:02:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 364. [2022-07-21 02:02:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 290 states have (on average 1.1793103448275861) internal successors, (342), 309 states have internal predecessors, (342), 57 states have call successors, (57), 17 states have call predecessors, (57), 16 states have return successors, (53), 37 states have call predecessors, (53), 48 states have call successors, (53) [2022-07-21 02:02:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 452 transitions. [2022-07-21 02:02:16,227 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 452 transitions. Word has length 63 [2022-07-21 02:02:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:02:16,228 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 452 transitions. [2022-07-21 02:02:16,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 46 states have (on average 2.152173913043478) internal successors, (99), 49 states have internal predecessors, (99), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-21 02:02:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 452 transitions. [2022-07-21 02:02:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 02:02:16,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:02:16,231 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:02:16,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 02:02:16,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-21 02:02:16,450 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:02:16,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:02:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2093533259, now seen corresponding path program 1 times [2022-07-21 02:02:16,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:02:16,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084492184] [2022-07-21 02:02:16,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:16,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:02:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:16,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:02:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:16,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:02:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:16,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 02:02:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:17,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 02:02:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:18,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 02:02:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 29 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 02:02:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:02:19,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084492184] [2022-07-21 02:02:19,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084492184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:02:19,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287540992] [2022-07-21 02:02:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:19,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:02:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:02:19,532 INFO L229 MonitoredProcess]: Starting monitored process 17 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:02:19,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-21 02:02:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:19,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 178 conjunts are in the unsatisfiable core [2022-07-21 02:02:19,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:02:20,057 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:02:20,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:02:20,061 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 8 treesize of output 7 [2022-07-21 02:02:20,065 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 12 treesize of output 11 [2022-07-21 02:02:20,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:20,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-21 02:02:20,094 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 9 treesize of output 7 [2022-07-21 02:02:20,190 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 8 treesize of output 4 [2022-07-21 02:02:20,221 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:02:20,398 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:02:20,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:02:20,405 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 8 treesize of output 7 [2022-07-21 02:02:20,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:02:20,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:02:20,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2022-07-21 02:02:20,478 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:02:20,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-21 02:02:20,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-07-21 02:02:20,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:20,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:20,695 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 30 treesize of output 25 [2022-07-21 02:02:20,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-21 02:02:20,703 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 12 treesize of output 11 [2022-07-21 02:02:20,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:20,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:20,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:20,883 INFO L356 Elim1Store]: treesize reduction 19, result has 42.4 percent of original size [2022-07-21 02:02:20,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 41 [2022-07-21 02:02:20,903 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-21 02:02:20,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 41 [2022-07-21 02:02:20,908 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:02:20,919 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 12 treesize of output 11 [2022-07-21 02:02:21,012 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:02:21,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 23 [2022-07-21 02:02:21,019 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:02:21,020 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 19 treesize of output 7 [2022-07-21 02:02:21,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 02:02:21,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:21,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:21,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:21,363 INFO L356 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-07-21 02:02:21,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2022-07-21 02:02:21,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:21,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:21,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:21,397 INFO L356 Elim1Store]: treesize reduction 67, result has 25.6 percent of original size [2022-07-21 02:02:21,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 77 [2022-07-21 02:02:21,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2022-07-21 02:02:21,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-21 02:02:21,420 INFO L356 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-07-21 02:02:21,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-21 02:02:21,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 82 [2022-07-21 02:02:21,759 INFO L356 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2022-07-21 02:02:21,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 80 [2022-07-21 02:02:21,766 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:02:21,767 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 15 treesize of output 7 [2022-07-21 02:02:22,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:22,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:22,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:22,368 INFO L356 Elim1Store]: treesize reduction 180, result has 22.4 percent of original size [2022-07-21 02:02:22,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 152 treesize of output 159 [2022-07-21 02:02:22,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:22,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:22,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:22,391 INFO L356 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-07-21 02:02:22,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 34 [2022-07-21 02:02:22,400 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 10 treesize of output 9 [2022-07-21 02:02:22,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-21 02:02:22,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:02:22,710 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 32 treesize of output 24 [2022-07-21 02:02:22,785 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 18 treesize of output 14 [2022-07-21 02:02:23,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2022-07-21 02:02:23,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2022-07-21 02:02:24,130 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 88 [2022-07-21 02:02:26,775 INFO L356 Elim1Store]: treesize reduction 12, result has 83.6 percent of original size [2022-07-21 02:02:26,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 421 treesize of output 445 [2022-07-21 02:02:34,842 INFO L356 Elim1Store]: treesize reduction 8, result has 97.8 percent of original size [2022-07-21 02:02:34,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 16 new quantified variables, introduced 45 case distinctions, treesize of input 454 treesize of output 544 [2022-07-21 02:02:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:02:54,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:02:55,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6485 (Array Int Int)) (v_ArrVal_6484 (Array Int Int)) (|v_chain_node_~node~0#1.base_60| Int) (v_ArrVal_6483 (Array Int Int))) (or (not (< |v_chain_node_~node~0#1.base_60| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_60| (store v_ArrVal_6485 0 (select (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_60| v_ArrVal_6485) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))) |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |v_chain_node_~node~0#1.base_60| v_ArrVal_6484) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| |v_chain_node_~node~0#1.base_60|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_60| (store v_ArrVal_6483 0 (select (select (store |c_#memory_$Pointer$.offset| |v_chain_node_~node~0#1.base_60| v_ArrVal_6483) |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset|))))) (store .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base|) |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 0))) |c_ULTIMATE.start_main_~#p1~0#1.base|) |c_ULTIMATE.start_main_~#p1~0#1.offset|)) 0)))) is different from false [2022-07-21 02:02:55,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287540992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:02:55,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 02:02:55,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 45 [2022-07-21 02:02:55,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339834766] [2022-07-21 02:02:55,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 02:02:55,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 02:02:55,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:02:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 02:02:55,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1803, Unknown=44, NotChecked=86, Total=2070 [2022-07-21 02:02:55,005 INFO L87 Difference]: Start difference. First operand 364 states and 452 transitions. Second operand has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 39 states have internal predecessors, (92), 10 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-21 02:02:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:02:58,402 INFO L93 Difference]: Finished difference Result 416 states and 517 transitions. [2022-07-21 02:02:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 02:02:58,402 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 39 states have internal predecessors, (92), 10 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) Word has length 64 [2022-07-21 02:02:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:02:58,404 INFO L225 Difference]: With dead ends: 416 [2022-07-21 02:02:58,404 INFO L226 Difference]: Without dead ends: 413 [2022-07-21 02:02:58,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=273, Invalid=3454, Unknown=59, NotChecked=120, Total=3906 [2022-07-21 02:02:58,405 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 122 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 2630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 843 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 02:02:58,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 2113 Invalid, 2630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1739 Invalid, 0 Unknown, 843 Unchecked, 1.3s Time] [2022-07-21 02:02:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-07-21 02:02:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 368. [2022-07-21 02:02:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 293 states have (on average 1.180887372013652) internal successors, (346), 313 states have internal predecessors, (346), 57 states have call successors, (57), 17 states have call predecessors, (57), 17 states have return successors, (55), 37 states have call predecessors, (55), 48 states have call successors, (55) [2022-07-21 02:02:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 458 transitions. [2022-07-21 02:02:58,458 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 458 transitions. Word has length 64 [2022-07-21 02:02:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:02:58,459 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 458 transitions. [2022-07-21 02:02:58,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 39 states have internal predecessors, (92), 10 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (10), 10 states have call predecessors, (10), 7 states have call successors, (10) [2022-07-21 02:02:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 458 transitions. [2022-07-21 02:02:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 02:02:58,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:02:58,460 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:02:58,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-21 02:02:58,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 02:02:58,680 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:02:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:02:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash 17440653, now seen corresponding path program 1 times [2022-07-21 02:02:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:02:58,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811106359] [2022-07-21 02:02:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:02:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 02:02:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 02:02:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 02:02:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 02:02:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 02:02:58,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:02:58,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811106359] [2022-07-21 02:02:58,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811106359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:02:58,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960987954] [2022-07-21 02:02:58,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:02:58,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:02:58,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:02:58,988 INFO L229 MonitoredProcess]: Starting monitored process 18 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:02:58,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-21 02:02:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:02:59,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-21 02:02:59,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:02:59,437 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-07-21 02:02:59,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-07-21 02:02:59,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-21 02:02:59,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 12 treesize of output 11 [2022-07-21 02:02:59,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:02:59,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 19 [2022-07-21 02:02:59,471 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 9 treesize of output 7 [2022-07-21 02:02:59,911 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 02:02:59,912 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-21 02:02:59,951 INFO L356 Elim1Store]: treesize reduction 46, result has 44.6 percent of original size [2022-07-21 02:02:59,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 59