./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_unequal.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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:53:07,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:53:07,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:53:07,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:53:07,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:53:07,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:53:07,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:53:07,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:53:07,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:53:07,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:53:07,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:53:07,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:53:07,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:53:07,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:53:07,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:53:07,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:53:07,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:53:07,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:53:07,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:53:07,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:53:07,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:53:07,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:53:07,131 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:53:07,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:53:07,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:53:07,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:53:07,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:53:07,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:53:07,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:53:07,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:53:07,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:53:07,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:53:07,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:53:07,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:53:07,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:53:07,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:53:07,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:53:07,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:53:07,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:53:07,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:53:07,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:53:07,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 08:53:07,181 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:53:07,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:53:07,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:53:07,183 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:53:07,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:53:07,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:53:07,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:53:07,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:53:07,185 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:53:07,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:53:07,185 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:53:07,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 08:53:07,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:53:07,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:53:07,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:53:07,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:53:07,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:53:07,187 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:53:07,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:53:07,187 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:53:07,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:53:07,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:53:07,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:53:07,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:53:07,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:53:07,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:53:07,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:53:07,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:53:07,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 08:53:07,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 08:53:07,190 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:53:07,190 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:53:07,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:53:07,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:53:07,191 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2021-12-17 08:53:07,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:53:07,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:53:07,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:53:07,399 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:53:07,403 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:53:07,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2021-12-17 08:53:07,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef4785f1/66aa0a0501f44421b37989b254f53609/FLAG8d33478c9 [2021-12-17 08:53:07,902 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:53:07,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2021-12-17 08:53:07,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef4785f1/66aa0a0501f44421b37989b254f53609/FLAG8d33478c9 [2021-12-17 08:53:08,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef4785f1/66aa0a0501f44421b37989b254f53609 [2021-12-17 08:53:08,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:53:08,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:53:08,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:53:08,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:53:08,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:53:08,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368c80bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08, skipping insertion in model container [2021-12-17 08:53:08,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:53:08,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:53:08,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2021-12-17 08:53:08,585 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:53:08,593 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:53:08,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2021-12-17 08:53:08,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:53:08,671 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:53:08,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08 WrapperNode [2021-12-17 08:53:08,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:53:08,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:53:08,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:53:08,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:53:08,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,735 INFO L137 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 138 [2021-12-17 08:53:08,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:53:08,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:53:08,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:53:08,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:53:08,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:53:08,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:53:08,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:53:08,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:53:08,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (1/1) ... [2021-12-17 08:53:08,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:53:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:08,814 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) [2021-12-17 08:53:08,816 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 [2021-12-17 08:53:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 08:53:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 08:53:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 08:53:08,849 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 08:53:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 08:53:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:53:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 08:53:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:53:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:53:08,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 08:53:08,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 08:53:08,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 08:53:08,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:53:08,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:53:09,003 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:53:09,005 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:53:09,232 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:53:09,237 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:53:09,241 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 08:53:09,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:53:09 BoogieIcfgContainer [2021-12-17 08:53:09,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:53:09,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:53:09,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:53:09,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:53:09,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:53:08" (1/3) ... [2021-12-17 08:53:09,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de4089b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:53:09, skipping insertion in model container [2021-12-17 08:53:09,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:53:08" (2/3) ... [2021-12-17 08:53:09,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de4089b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:53:09, skipping insertion in model container [2021-12-17 08:53:09,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:53:09" (3/3) ... [2021-12-17 08:53:09,250 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2021-12-17 08:53:09,254 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:53:09,254 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 08:53:09,326 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:53:09,333 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 08:53:09,334 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 08:53:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:53:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 08:53:09,363 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:09,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:09,365 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2021-12-17 08:53:09,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:09,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690684059] [2021-12-17 08:53:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:09,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:09,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 08:53:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:09,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:09,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690684059] [2021-12-17 08:53:09,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690684059] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:09,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:09,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:53:09,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042265956] [2021-12-17 08:53:09,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:09,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:53:09,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:53:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:53:09,637 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 08:53:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:09,711 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2021-12-17 08:53:09,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:53:09,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-17 08:53:09,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:09,719 INFO L225 Difference]: With dead ends: 65 [2021-12-17 08:53:09,719 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 08:53:09,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:53:09,725 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:09,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:53:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 08:53:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 08:53:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:53:09,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-12-17 08:53:09,752 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2021-12-17 08:53:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:09,752 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-17 08:53:09,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 08:53:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2021-12-17 08:53:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 08:53:09,755 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:09,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:09,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 08:53:09,756 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:09,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2021-12-17 08:53:09,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:09,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691913153] [2021-12-17 08:53:09,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:09,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:09,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-12-17 08:53:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:09,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:09,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691913153] [2021-12-17 08:53:09,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691913153] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:09,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:09,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:53:09,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101071974] [2021-12-17 08:53:09,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:09,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:53:09,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:09,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:53:09,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:53:09,889 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 08:53:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:09,951 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2021-12-17 08:53:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:53:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-17 08:53:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:09,954 INFO L225 Difference]: With dead ends: 58 [2021-12-17 08:53:09,954 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 08:53:09,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:53:09,961 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:09,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:53:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 08:53:09,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2021-12-17 08:53:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:53:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-17 08:53:09,968 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2021-12-17 08:53:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:09,968 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-17 08:53:09,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 08:53:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-12-17 08:53:09,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 08:53:09,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:09,969 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:09,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 08:53:09,970 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:09,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:09,970 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2021-12-17 08:53:09,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:09,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227230980] [2021-12-17 08:53:09,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:09,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:10,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:10,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-17 08:53:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:53:10,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:10,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227230980] [2021-12-17 08:53:10,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227230980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:10,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:10,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:53:10,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343088615] [2021-12-17 08:53:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:10,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:53:10,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:10,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:53:10,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:53:10,147 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:53:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:10,209 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2021-12-17 08:53:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:53:10,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2021-12-17 08:53:10,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:10,210 INFO L225 Difference]: With dead ends: 63 [2021-12-17 08:53:10,210 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 08:53:10,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:53:10,212 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:10,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:53:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 08:53:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-12-17 08:53:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:53:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-12-17 08:53:10,218 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2021-12-17 08:53:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:10,218 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-17 08:53:10,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:53:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2021-12-17 08:53:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 08:53:10,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:10,219 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:10,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 08:53:10,220 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2021-12-17 08:53:10,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:10,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679670020] [2021-12-17 08:53:10,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:10,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:10,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:10,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-17 08:53:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:53:10,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:10,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679670020] [2021-12-17 08:53:10,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679670020] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:10,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359573546] [2021-12-17 08:53:10,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:10,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:10,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:10,314 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) [2021-12-17 08:53:10,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 08:53:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:10,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 08:53:10,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:10,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:53:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:53:10,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359573546] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:53:10,599 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:53:10,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-12-17 08:53:10,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215050600] [2021-12-17 08:53:10,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:53:10,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:53:10,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:10,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:53:10,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:53:10,602 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 08:53:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:10,659 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2021-12-17 08:53:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 08:53:10,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2021-12-17 08:53:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:10,660 INFO L225 Difference]: With dead ends: 59 [2021-12-17 08:53:10,660 INFO L226 Difference]: Without dead ends: 36 [2021-12-17 08:53:10,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:53:10,669 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:10,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:53:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-17 08:53:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-17 08:53:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:53:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2021-12-17 08:53:10,682 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2021-12-17 08:53:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:10,682 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2021-12-17 08:53:10,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 08:53:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2021-12-17 08:53:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 08:53:10,683 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:10,684 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:10,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 08:53:10,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:10,885 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:10,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2021-12-17 08:53:10,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:10,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315016596] [2021-12-17 08:53:10,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:10,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:11,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:53:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:11,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:53:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:53:11,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:11,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315016596] [2021-12-17 08:53:11,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315016596] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:11,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58103664] [2021-12-17 08:53:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:11,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:11,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:11,220 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) [2021-12-17 08:53:11,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 08:53:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:11,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-17 08:53:11,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:11,737 INFO L388 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 17 treesize of output 9 [2021-12-17 08:53:11,796 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_520 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_520))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2021-12-17 08:53:11,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:11,861 INFO L388 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 24 [2021-12-17 08:53:11,903 INFO L388 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 13 [2021-12-17 08:53:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-12-17 08:53:11,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:53:12,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (|v_node_create_~temp~0#1.base_13| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_13| v_ArrVal_523) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (or (<= |c_#StackHeapBarrier| |v_node_create_~temp~0#1.base_13|) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2021-12-17 08:53:12,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58103664] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:12,044 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:53:12,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2021-12-17 08:53:12,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96485343] [2021-12-17 08:53:12,045 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:53:12,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-17 08:53:12,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-17 08:53:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=525, Unknown=2, NotChecked=94, Total=702 [2021-12-17 08:53:12,046 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 08:53:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:12,384 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2021-12-17 08:53:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 08:53:12,397 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2021-12-17 08:53:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:12,397 INFO L225 Difference]: With dead ends: 46 [2021-12-17 08:53:12,397 INFO L226 Difference]: Without dead ends: 36 [2021-12-17 08:53:12,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=856, Unknown=2, NotChecked=122, Total=1122 [2021-12-17 08:53:12,399 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:12,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 192 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 147 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2021-12-17 08:53:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-17 08:53:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-17 08:53:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:53:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-12-17 08:53:12,403 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 37 [2021-12-17 08:53:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:12,404 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-12-17 08:53:12,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 08:53:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2021-12-17 08:53:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 08:53:12,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:12,405 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:53:12,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 08:53:12,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:12,632 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:12,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:12,632 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2021-12-17 08:53:12,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:12,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387177554] [2021-12-17 08:53:12,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:12,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:53:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:53:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:53:13,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:13,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387177554] [2021-12-17 08:53:13,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387177554] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:13,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177416328] [2021-12-17 08:53:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:13,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:13,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:13,270 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) [2021-12-17 08:53:13,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 08:53:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:13,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 82 conjunts are in the unsatisfiable core [2021-12-17 08:53:13,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:13,465 INFO L388 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 [2021-12-17 08:53:13,798 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:53:13,799 INFO L388 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 17 treesize of output 21 [2021-12-17 08:53:13,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:53:13,944 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:53:13,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-17 08:53:14,253 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-17 08:53:14,254 INFO L388 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 84 treesize of output 29 [2021-12-17 08:53:14,260 INFO L388 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 11 treesize of output 7 [2021-12-17 08:53:14,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:14,439 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:53:14,439 INFO L388 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 92 treesize of output 80 [2021-12-17 08:53:14,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:14,446 INFO L388 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 66 treesize of output 64 [2021-12-17 08:53:14,462 INFO L354 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2021-12-17 08:53:14,463 INFO L388 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 2 case distinctions, treesize of input 34 treesize of output 36 [2021-12-17 08:53:14,800 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 08:53:14,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 69 [2021-12-17 08:53:14,831 INFO L354 Elim1Store]: treesize reduction 126, result has 14.3 percent of original size [2021-12-17 08:53:14,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 67 [2021-12-17 08:53:14,861 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-12-17 08:53:14,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 121 [2021-12-17 08:53:14,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:14,869 INFO L388 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 73 treesize of output 71 [2021-12-17 08:53:14,884 INFO L388 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 32 [2021-12-17 08:53:14,937 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-17 08:53:14,937 INFO L388 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 75 treesize of output 24 [2021-12-17 08:53:14,970 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:14,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:53:19,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177416328] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:19,386 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:53:19,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26] total 44 [2021-12-17 08:53:19,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357782413] [2021-12-17 08:53:19,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:53:19,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-17 08:53:19,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:19,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-17 08:53:19,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2276, Unknown=12, NotChecked=0, Total=2450 [2021-12-17 08:53:19,388 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 44 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 36 states have internal predecessors, (62), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 08:53:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:20,782 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2021-12-17 08:53:20,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 08:53:20,783 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 36 states have internal predecessors, (62), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2021-12-17 08:53:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:20,784 INFO L225 Difference]: With dead ends: 67 [2021-12-17 08:53:20,785 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 08:53:20,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=340, Invalid=4070, Unknown=12, NotChecked=0, Total=4422 [2021-12-17 08:53:20,787 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 61 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:20,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 382 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 597 Invalid, 0 Unknown, 10 Unchecked, 0.4s Time] [2021-12-17 08:53:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 08:53:20,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-12-17 08:53:20,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:53:20,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2021-12-17 08:53:20,792 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 40 [2021-12-17 08:53:20,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:20,793 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2021-12-17 08:53:20,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 36 states have internal predecessors, (62), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 08:53:20,793 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2021-12-17 08:53:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 08:53:20,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:20,794 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-17 08:53:20,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-17 08:53:21,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:21,008 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:21,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2021-12-17 08:53:21,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:21,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666302344] [2021-12-17 08:53:21,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:21,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:53:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:22,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:53:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:53:22,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666302344] [2021-12-17 08:53:22,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666302344] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444264399] [2021-12-17 08:53:22,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:22,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:22,498 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) [2021-12-17 08:53:22,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 08:53:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:22,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 152 conjunts are in the unsatisfiable core [2021-12-17 08:53:22,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:22,844 INFO L388 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 [2021-12-17 08:53:22,942 INFO L388 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 [2021-12-17 08:53:23,074 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:53:23,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 08:53:23,305 INFO L388 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:53:23,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-17 08:53:23,488 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-17 08:53:23,489 INFO L388 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 22 treesize of output 33 [2021-12-17 08:53:23,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:23,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 [2021-12-17 08:53:23,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:53:23,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-12-17 08:53:23,722 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:53:23,723 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 61 [2021-12-17 08:53:23,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-17 08:53:24,183 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:53:24,183 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 41 [2021-12-17 08:53:24,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:53:24,202 INFO L388 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 16 treesize of output 10 [2021-12-17 08:53:24,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:24,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:53:24,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:24,496 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:53:24,497 INFO L388 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 96 treesize of output 76 [2021-12-17 08:53:24,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:24,507 INFO L388 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 18 treesize of output 20 [2021-12-17 08:53:24,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:24,523 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:53:24,523 INFO L388 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 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-17 08:53:25,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:53:25,386 INFO L354 Elim1Store]: treesize reduction 157, result has 13.3 percent of original size [2021-12-17 08:53:25,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 222 treesize of output 108 [2021-12-17 08:53:25,421 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:53:25,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 310 treesize of output 195 [2021-12-17 08:53:25,439 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 08:53:25,439 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 264 treesize of output 211 [2021-12-17 08:53:25,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2021-12-17 08:53:25,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:25,454 INFO L388 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 45 treesize of output 50 [2021-12-17 08:53:25,608 INFO L354 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2021-12-17 08:53:25,609 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 59 [2021-12-17 08:53:25,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 10 [2021-12-17 08:53:25,698 INFO L388 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 15 treesize of output 7 [2021-12-17 08:53:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:53:25,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:53:25,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1041) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 08:53:26,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (= (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1041) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select .cse1 .cse2))))))) is different from false [2021-12-17 08:53:26,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (= (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1041) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select .cse1 .cse2))))))) is different from false [2021-12-17 08:53:26,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (= (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1045) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1041) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1040) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select .cse1 .cse2))))))) is different from false [2021-12-17 08:53:26,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1058 (Array Int Int)) (v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_20| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_11| Int) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20| v_ArrVal_1058)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20| v_ArrVal_1056))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_11| 4))) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20|) (= (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20| v_ArrVal_1057) .cse0 v_ArrVal_1045) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20| v_ArrVal_1041) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20| v_ArrVal_1037) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20| v_ArrVal_1040) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_20|))) (not (= 0 (select .cse2 .cse3)))))))) is different from false [2021-12-17 08:53:26,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444264399] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:26,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:53:26,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 55 [2021-12-17 08:53:26,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944432177] [2021-12-17 08:53:26,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:53:26,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-17 08:53:26,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-17 08:53:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3016, Unknown=7, NotChecked=570, Total=3782 [2021-12-17 08:53:26,225 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 46 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:53:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:28,484 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-12-17 08:53:28,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 08:53:28,484 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 46 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2021-12-17 08:53:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:28,485 INFO L225 Difference]: With dead ends: 54 [2021-12-17 08:53:28,485 INFO L226 Difference]: Without dead ends: 52 [2021-12-17 08:53:28,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=389, Invalid=5324, Unknown=7, NotChecked=760, Total=6480 [2021-12-17 08:53:28,488 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 53 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:28,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 486 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 965 Invalid, 0 Unknown, 57 Unchecked, 0.6s Time] [2021-12-17 08:53:28,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-17 08:53:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2021-12-17 08:53:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:53:28,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2021-12-17 08:53:28,494 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 44 [2021-12-17 08:53:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:28,495 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2021-12-17 08:53:28,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 46 states have internal predecessors, (73), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:53:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2021-12-17 08:53:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-17 08:53:28,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:28,496 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-17 08:53:28,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 08:53:28,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:28,715 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:28,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1173262244, now seen corresponding path program 1 times [2021-12-17 08:53:28,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:28,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140411611] [2021-12-17 08:53:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:28,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:28,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:53:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:28,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:53:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-17 08:53:28,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:28,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140411611] [2021-12-17 08:53:28,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140411611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:53:28,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:53:28,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 08:53:28,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663685105] [2021-12-17 08:53:28,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:53:28,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:53:28,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:28,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:53:28,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:53:28,810 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 08:53:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:28,888 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2021-12-17 08:53:28,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 08:53:28,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-17 08:53:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:28,892 INFO L225 Difference]: With dead ends: 56 [2021-12-17 08:53:28,892 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 08:53:28,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-17 08:53:28,893 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:28,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:53:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 08:53:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2021-12-17 08:53:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:53:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2021-12-17 08:53:28,909 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 45 [2021-12-17 08:53:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:28,909 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2021-12-17 08:53:28,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 08:53:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2021-12-17 08:53:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-17 08:53:28,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:28,915 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-12-17 08:53:28,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 08:53:28,915 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -731397669, now seen corresponding path program 2 times [2021-12-17 08:53:28,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:28,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834402447] [2021-12-17 08:53:28,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:28,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:53:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:53:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:53:29,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:29,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834402447] [2021-12-17 08:53:29,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834402447] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:29,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723670612] [2021-12-17 08:53:29,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:53:29,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:29,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:29,832 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) [2021-12-17 08:53:29,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 08:53:30,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:53:30,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:53:30,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 185 conjunts are in the unsatisfiable core [2021-12-17 08:53:30,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:30,138 INFO L388 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 [2021-12-17 08:53:30,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:53:30,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:53:30,690 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:53:30,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 08:53:30,707 INFO L388 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 16 treesize of output 18 [2021-12-17 08:53:30,714 INFO L388 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 16 treesize of output 18 [2021-12-17 08:53:30,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:30,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-17 08:53:30,818 INFO L388 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 11 treesize of output 14 [2021-12-17 08:53:30,822 INFO L388 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 16 treesize of output 18 [2021-12-17 08:53:30,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2021-12-17 08:53:30,833 INFO L388 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 16 treesize of output 18 [2021-12-17 08:53:30,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:30,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:30,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:53:30,947 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:53:30,948 INFO L388 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 1 case distinctions, treesize of input 128 treesize of output 91 [2021-12-17 08:53:30,969 INFO L354 Elim1Store]: treesize reduction 84, result has 21.5 percent of original size [2021-12-17 08:53:30,969 INFO L388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 70 [2021-12-17 08:53:30,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:30,980 INFO L388 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 20 treesize of output 22 [2021-12-17 08:53:31,390 INFO L354 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2021-12-17 08:53:31,391 INFO L388 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 71 [2021-12-17 08:53:31,400 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:53:31,401 INFO L388 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 35 treesize of output 18 [2021-12-17 08:53:31,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:31,630 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 08:53:31,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 108 [2021-12-17 08:53:31,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:31,639 INFO L388 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 18 treesize of output 20 [2021-12-17 08:53:31,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:31,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:31,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:31,651 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-17 08:53:31,651 INFO L388 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 86 treesize of output 76 [2021-12-17 08:53:31,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:31,667 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:53:31,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 08:53:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:32,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:53:33,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1469 (Array Int Int)) (v_ArrVal_1467 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| Int) (v_ArrVal_1466 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (v_ArrVal_1464 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1484 (Array Int Int)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1485)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1486))) (let ((.cse7 (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse8 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse1 .cse7) .cse8)) (.cse6 (+ (select (select .cse4 .cse7) .cse8) 4))) (let ((.cse0 (select (select .cse1 .cse5) .cse6))) (let ((.cse2 (select .cse1 .cse0)) (.cse3 (+ |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1484) .cse0 v_ArrVal_1464) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1467) (select (select (store (store .cse1 .cse0 (store .cse2 .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1466) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store .cse4 .cse0 (store (select .cse4 .cse0) .cse3 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24| v_ArrVal_1469) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|) (and (= (select (select .cse4 .cse5) .cse6) 0) (= .cse0 0)) (not (= 0 (select .cse2 .cse3))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_24|)))))))))) is different from false [2021-12-17 08:53:33,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723670612] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:33,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:53:33,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 45 [2021-12-17 08:53:33,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034254035] [2021-12-17 08:53:33,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:53:33,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-17 08:53:33,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:33,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-17 08:53:33,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2854, Unknown=38, NotChecked=108, Total=3192 [2021-12-17 08:53:33,658 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:53:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:34,882 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2021-12-17 08:53:34,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-17 08:53:34,882 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2021-12-17 08:53:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:34,883 INFO L225 Difference]: With dead ends: 79 [2021-12-17 08:53:34,883 INFO L226 Difference]: Without dead ends: 64 [2021-12-17 08:53:34,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=316, Invalid=4204, Unknown=40, NotChecked=132, Total=4692 [2021-12-17 08:53:34,884 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:34,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 383 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 625 Invalid, 0 Unknown, 46 Unchecked, 0.5s Time] [2021-12-17 08:53:34,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-17 08:53:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2021-12-17 08:53:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-17 08:53:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2021-12-17 08:53:34,892 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 46 [2021-12-17 08:53:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:34,892 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2021-12-17 08:53:34,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.558139534883721) internal successors, (67), 37 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:53:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2021-12-17 08:53:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-17 08:53:34,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:34,893 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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] [2021-12-17 08:53:34,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 08:53:35,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:35,100 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2018358036, now seen corresponding path program 1 times [2021-12-17 08:53:35,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:35,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128843970] [2021-12-17 08:53:35,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:35,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:35,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:53:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:36,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:53:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:53:36,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:36,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128843970] [2021-12-17 08:53:36,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128843970] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:36,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090813498] [2021-12-17 08:53:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:36,330 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:36,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:36,332 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) [2021-12-17 08:53:36,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 08:53:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:36,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 169 conjunts are in the unsatisfiable core [2021-12-17 08:53:36,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:36,532 INFO L388 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 [2021-12-17 08:53:36,614 INFO L388 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 [2021-12-17 08:53:36,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:36,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-17 08:53:36,850 INFO L388 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 13 treesize of output 9 [2021-12-17 08:53:36,855 INFO L388 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 13 treesize of output 9 [2021-12-17 08:53:36,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:36,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-17 08:53:37,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:37,072 INFO L388 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 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-17 08:53:37,078 INFO L388 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 7 treesize of output 3 [2021-12-17 08:53:37,082 INFO L388 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 7 treesize of output 3 [2021-12-17 08:53:37,085 INFO L388 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 7 treesize of output 3 [2021-12-17 08:53:37,352 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:53:37,352 INFO L388 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-17 08:53:37,361 INFO L388 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 [2021-12-17 08:53:37,379 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:53:37,379 INFO L388 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-17 08:53:37,401 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:53:37,402 INFO L388 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 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-17 08:53:37,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:37,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:37,454 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:53:37,454 INFO L388 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 22 treesize of output 29 [2021-12-17 08:53:37,623 INFO L388 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 14 treesize of output 16 [2021-12-17 08:53:37,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2021-12-17 08:53:37,639 INFO L388 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 14 treesize of output 16 [2021-12-17 08:53:37,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2021-12-17 08:53:37,657 INFO L388 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 14 treesize of output 16 [2021-12-17 08:53:37,791 INFO L354 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2021-12-17 08:53:37,792 INFO L388 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 149 treesize of output 82 [2021-12-17 08:53:37,797 INFO L388 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 37 treesize of output 30 [2021-12-17 08:53:37,802 INFO L388 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 46 treesize of output 42 [2021-12-17 08:53:38,287 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 08:53:38,288 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 65 [2021-12-17 08:53:38,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,303 INFO L388 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2021-12-17 08:53:38,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:53:38,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,327 INFO L388 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 16 treesize of output 10 [2021-12-17 08:53:38,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,517 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 08:53:38,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 191 treesize of output 159 [2021-12-17 08:53:38,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,538 INFO L354 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2021-12-17 08:53:38,539 INFO L388 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 3 case distinctions, treesize of input 165 treesize of output 162 [2021-12-17 08:53:38,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,546 INFO L388 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 28 treesize of output 30 [2021-12-17 08:53:38,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:38,570 INFO L354 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2021-12-17 08:53:38,570 INFO L388 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 2 case distinctions, treesize of input 39 treesize of output 39 [2021-12-17 08:53:39,287 INFO L354 Elim1Store]: treesize reduction 47, result has 48.9 percent of original size [2021-12-17 08:53:39,288 INFO L388 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 64 [2021-12-17 08:53:39,348 INFO L354 Elim1Store]: treesize reduction 178, result has 16.8 percent of original size [2021-12-17 08:53:39,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 130 [2021-12-17 08:53:39,396 INFO L354 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2021-12-17 08:53:39,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 254 [2021-12-17 08:53:39,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:39,434 INFO L354 Elim1Store]: treesize reduction 104, result has 24.6 percent of original size [2021-12-17 08:53:39,434 INFO L388 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 214 [2021-12-17 08:53:39,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:39,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:39,460 INFO L354 Elim1Store]: treesize reduction 43, result has 10.4 percent of original size [2021-12-17 08:53:39,460 INFO L388 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 3 case distinctions, treesize of input 240 treesize of output 231 [2021-12-17 08:53:39,468 INFO L388 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 56 treesize of output 58 [2021-12-17 08:53:39,615 INFO L388 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 32 [2021-12-17 08:53:40,898 INFO L354 Elim1Store]: treesize reduction 122, result has 2.4 percent of original size [2021-12-17 08:53:40,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 437 treesize of output 128 [2021-12-17 08:53:40,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:40,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:40,908 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-12-17 08:53:40,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 74 [2021-12-17 08:53:41,031 INFO L388 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 28 treesize of output 20 [2021-12-17 08:53:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 08:53:41,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:53:41,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1758 Int) (v_ArrVal_1759 (Array Int Int)) (v_ArrVal_1757 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 v_ArrVal_1758)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1759)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1756))) (let ((.cse6 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse6) .cse7)) (.cse4 (select (select .cse3 .cse6) .cse7))) (or (let ((.cse2 (+ .cse4 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 v_ArrVal_1757)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1765) .cse1) .cse4) |c_ULTIMATE.start_main_~data~0#1|))))))) is different from false [2021-12-17 08:53:42,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1758 Int) (v_ArrVal_1759 (Array Int Int)) (v_ArrVal_1757 Int)) (let ((.cse6 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse5 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 v_ArrVal_1758)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1759)) (.cse0 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse6 .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1756))) (let ((.cse7 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse0 .cse7) .cse8)) (.cse4 (select (select .cse3 .cse7) .cse8))) (or (let ((.cse2 (+ .cse4 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_dll_append_~last~0#1.base|) .cse5 v_ArrVal_1757)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1765) .cse1) .cse4) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select .cse6 .cse5) 0)))))))) is different from false [2021-12-17 08:53:42,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| Int) (v_ArrVal_1756 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1774 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1758 Int) (v_ArrVal_1759 (Array Int Int)) (v_ArrVal_1757 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_1776))) (let ((.cse5 (select .cse10 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse6 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse0 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_1774))) (store .cse11 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse6 v_ArrVal_1758))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_1759)) (.cse3 (store (store .cse10 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse5 .cse6 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_1756))) (let ((.cse8 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse1 (select (select .cse3 .cse8) .cse9)) (.cse4 (select (select .cse0 .cse8) .cse9))) (or (let ((.cse2 (+ .cse4 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0))) (not (= (select .cse5 .cse6) 0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28|))) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28|) (= (select (select (store (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_1775))) (store .cse7 |ULTIMATE.start_dll_append_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_dll_append_~last~0#1.base|) .cse6 v_ArrVal_1757))) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_28| v_ArrVal_1765) .cse1) .cse4) |c_ULTIMATE.start_main_~data~0#1|)))))))) is different from false [2021-12-17 08:53:42,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090813498] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:42,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:53:42,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2021-12-17 08:53:42,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015559407] [2021-12-17 08:53:42,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:53:42,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-17 08:53:42,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:42,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-17 08:53:42,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3360, Unknown=4, NotChecked=354, Total=3906 [2021-12-17 08:53:42,737 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 54 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:53:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:53:47,640 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2021-12-17 08:53:47,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-17 08:53:47,641 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 47 [2021-12-17 08:53:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:53:47,642 INFO L225 Difference]: With dead ends: 113 [2021-12-17 08:53:47,642 INFO L226 Difference]: Without dead ends: 111 [2021-12-17 08:53:47,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=510, Invalid=8240, Unknown=4, NotChecked=558, Total=9312 [2021-12-17 08:53:47,645 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 96 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 08:53:47,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 475 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1083 Invalid, 0 Unknown, 203 Unchecked, 0.8s Time] [2021-12-17 08:53:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-17 08:53:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2021-12-17 08:53:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.139240506329114) internal successors, (90), 79 states have internal predecessors, (90), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 08:53:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 106 transitions. [2021-12-17 08:53:47,659 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 106 transitions. Word has length 47 [2021-12-17 08:53:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:53:47,660 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 106 transitions. [2021-12-17 08:53:47,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 45 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:53:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 106 transitions. [2021-12-17 08:53:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-17 08:53:47,661 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:53:47,662 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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] [2021-12-17 08:53:47,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 08:53:47,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:47,872 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:53:47,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:53:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1855355832, now seen corresponding path program 1 times [2021-12-17 08:53:47,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:53:47,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21277480] [2021-12-17 08:53:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:47,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:53:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:53:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:48,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:53:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:48,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:53:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:53:48,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:53:48,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21277480] [2021-12-17 08:53:48,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21277480] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:48,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946885286] [2021-12-17 08:53:48,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:53:48,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:53:48,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:53:48,988 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) [2021-12-17 08:53:48,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 08:53:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:53:49,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 141 conjunts are in the unsatisfiable core [2021-12-17 08:53:49,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:53:49,493 INFO L388 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 [2021-12-17 08:53:49,714 INFO L388 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 [2021-12-17 08:53:49,854 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:53:49,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-17 08:53:49,922 INFO L388 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 13 treesize of output 9 [2021-12-17 08:53:49,937 INFO L388 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 13 treesize of output 9 [2021-12-17 08:53:50,020 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:53:50,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2021-12-17 08:53:50,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-12-17 08:53:50,342 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:53:50,343 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 37 [2021-12-17 08:53:50,348 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:53:50,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-17 08:53:50,353 INFO L388 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 [2021-12-17 08:53:50,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:50,567 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:53:50,568 INFO L388 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 80 treesize of output 68 [2021-12-17 08:53:50,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:50,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:50,577 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:53:50,577 INFO L388 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 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-17 08:53:50,596 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:53:50,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2021-12-17 08:53:51,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:51,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:53:51,174 INFO L354 Elim1Store]: treesize reduction 97, result has 19.8 percent of original size [2021-12-17 08:53:51,174 INFO L388 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 115 [2021-12-17 08:53:51,197 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:53:51,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 367 treesize of output 252 [2021-12-17 08:53:51,222 INFO L354 Elim1Store]: treesize reduction 120, result has 20.0 percent of original size [2021-12-17 08:53:51,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 334 treesize of output 219 [2021-12-17 08:53:51,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:51,244 INFO L354 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2021-12-17 08:53:51,244 INFO L388 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 4 case distinctions, treesize of input 200 treesize of output 169 [2021-12-17 08:53:51,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:51,594 INFO L354 Elim1Store]: treesize reduction 70, result has 4.1 percent of original size [2021-12-17 08:53:51,594 INFO L388 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 206 treesize of output 127 [2021-12-17 08:53:51,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:53:51,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:53:51,680 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 08:53:51,680 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 36 [2021-12-17 08:53:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:53:51,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:53:51,951 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (not (= (let ((.cse6 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6)) (.cse5 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse6) 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2025)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2024))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) 0))) is different from false [2021-12-17 08:53:54,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (not (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2025)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_2024))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) 0))) is different from false [2021-12-17 08:53:54,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (not (= (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse6) .cse7)) (.cse5 (+ (select (select |c_#memory_$Pointer$.offset| .cse6) .cse7) 4))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2025)) (.cse0 (store (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) .cse5 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_2024))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) 0))) is different from false [2021-12-17 08:53:54,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array Int Int)) (v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| Int)) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32|))) (= 0 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32|) (not (= (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_ArrVal_2035)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_ArrVal_2036))) (let ((.cse8 (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse9 (+ (select (select .cse7 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (let ((.cse5 (select (select .cse4 .cse8) .cse9)) (.cse6 (+ (select (select .cse7 .cse8) .cse9) 4))) (let ((.cse3 (store (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_ArrVal_2025)) (.cse0 (store (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_ArrVal_2024))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4))))))) 0)))) is different from false [2021-12-17 08:53:54,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946885286] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:53:54,904 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:53:54,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 52 [2021-12-17 08:53:54,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921266120] [2021-12-17 08:53:54,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:53:54,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-17 08:53:54,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:53:54,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-17 08:53:54,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2936, Unknown=6, NotChecked=444, Total=3540 [2021-12-17 08:53:54,906 INFO L87 Difference]: Start difference. First operand 89 states and 106 transitions. Second operand has 52 states, 50 states have (on average 1.52) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:54:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:54:04,050 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2021-12-17 08:54:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-17 08:54:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.52) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2021-12-17 08:54:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:54:04,052 INFO L225 Difference]: With dead ends: 97 [2021-12-17 08:54:04,052 INFO L226 Difference]: Without dead ends: 92 [2021-12-17 08:54:04,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=320, Invalid=4946, Unknown=6, NotChecked=580, Total=5852 [2021-12-17 08:54:04,053 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-17 08:54:04,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 606 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 866 Invalid, 0 Unknown, 58 Unchecked, 2.9s Time] [2021-12-17 08:54:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-17 08:54:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2021-12-17 08:54:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.125) internal successors, (90), 80 states have internal predecessors, (90), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 08:54:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2021-12-17 08:54:04,065 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 48 [2021-12-17 08:54:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:54:04,065 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2021-12-17 08:54:04,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.52) internal successors, (76), 43 states have internal predecessors, (76), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:54:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2021-12-17 08:54:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-17 08:54:04,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:54:04,066 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:54:04,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 08:54:04,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:54:04,271 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:54:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:54:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash 638551040, now seen corresponding path program 2 times [2021-12-17 08:54:04,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:54:04,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101558036] [2021-12-17 08:54:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:54:04,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:54:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:54:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:54:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:54:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:54:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:54:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:54:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:54:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:54:09,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:54:09,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101558036] [2021-12-17 08:54:09,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101558036] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:54:09,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986112575] [2021-12-17 08:54:09,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:54:09,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:54:09,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:54:09,515 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) [2021-12-17 08:54:09,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 08:54:09,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:54:09,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:54:09,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 148 conjunts are in the unsatisfiable core [2021-12-17 08:54:09,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:54:10,082 INFO L388 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 [2021-12-17 08:54:12,241 INFO L388 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 13 [2021-12-17 08:54:12,250 INFO L388 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 [2021-12-17 08:54:12,260 INFO L388 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 [2021-12-17 08:54:19,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:19,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:19,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:19,061 INFO L388 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 25 treesize of output 32 [2021-12-17 08:54:19,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:19,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:19,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:19,115 INFO L388 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 44 treesize of output 43 [2021-12-17 08:54:19,149 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 08:54:19,150 INFO L388 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 [2021-12-17 08:54:21,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:21,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:21,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:21,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:54:22,230 INFO L354 Elim1Store]: treesize reduction 156, result has 21.6 percent of original size [2021-12-17 08:54:22,231 INFO L388 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 328 treesize of output 151 [2021-12-17 08:54:22,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:22,460 INFO L354 Elim1Store]: treesize reduction 162, result has 20.2 percent of original size [2021-12-17 08:54:22,460 INFO L388 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 535 treesize of output 255 [2021-12-17 08:54:22,476 INFO L388 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 30 treesize of output 29 [2021-12-17 08:54:46,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:46,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:54:46,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:46,815 INFO L354 Elim1Store]: treesize reduction 201, result has 19.9 percent of original size [2021-12-17 08:54:46,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 424 treesize of output 197 [2021-12-17 08:54:46,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:46,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:54:47,024 INFO L354 Elim1Store]: treesize reduction 134, result has 12.4 percent of original size [2021-12-17 08:54:47,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 13 case distinctions, treesize of input 191 treesize of output 118 [2021-12-17 08:54:51,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:54:51,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:54:51,314 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2021-12-17 08:54:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:54:51,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:54:54,118 INFO L354 Elim1Store]: treesize reduction 4, result has 99.4 percent of original size [2021-12-17 08:54:54,119 INFO L388 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 1786 treesize of output 1785 [2021-12-17 08:54:54,163 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:54:54,163 INFO L388 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 830 treesize of output 834 [2021-12-17 08:54:59,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986112575] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:54:59,868 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:54:59,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 52 [2021-12-17 08:54:59,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898063535] [2021-12-17 08:54:59,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:54:59,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-17 08:54:59,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:54:59,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-17 08:54:59,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=4108, Unknown=1, NotChecked=0, Total=4290 [2021-12-17 08:54:59,870 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 52 states, 50 states have (on average 1.68) internal successors, (84), 45 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 08:55:09,593 WARN L227 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 62 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 08:55:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:19,558 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2021-12-17 08:55:19,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-17 08:55:19,558 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.68) internal successors, (84), 45 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2021-12-17 08:55:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:19,559 INFO L225 Difference]: With dead ends: 103 [2021-12-17 08:55:19,559 INFO L226 Difference]: Without dead ends: 95 [2021-12-17 08:55:19,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=374, Invalid=7281, Unknown=1, NotChecked=0, Total=7656 [2021-12-17 08:55:19,561 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 43 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:19,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 632 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 809 Invalid, 0 Unknown, 204 Unchecked, 2.8s Time] [2021-12-17 08:55:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-17 08:55:19,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-17 08:55:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-17 08:55:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2021-12-17 08:55:19,576 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 50 [2021-12-17 08:55:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:19,576 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2021-12-17 08:55:19,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.68) internal successors, (84), 45 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-17 08:55:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2021-12-17 08:55:19,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-17 08:55:19,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:19,578 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 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] [2021-12-17 08:55:19,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:19,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-17 08:55:19,783 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:19,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1679808732, now seen corresponding path program 2 times [2021-12-17 08:55:19,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:55:19,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953388184] [2021-12-17 08:55:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:19,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:55:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:23,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-17 08:55:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:23,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-17 08:55:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-17 08:55:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:55:25,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:55:25,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953388184] [2021-12-17 08:55:25,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953388184] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:25,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109942667] [2021-12-17 08:55:25,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:55:25,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:55:25,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:55:25,006 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) [2021-12-17 08:55:25,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-17 08:55:25,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:55:25,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:55:25,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 165 conjunts are in the unsatisfiable core [2021-12-17 08:55:25,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:25,269 INFO L388 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 [2021-12-17 08:55:25,492 INFO L388 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 [2021-12-17 08:55:26,156 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 1016785 column 46: unknown constant v_old(#valid)_AFTER_CALL_24 [2021-12-17 08:55:26,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-17 08:55:26,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-12-17 08:55:26,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525447566] [2021-12-17 08:55:26,157 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:26,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-17 08:55:26,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:55:26,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-17 08:55:26,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=986, Unknown=0, NotChecked=0, Total=1056 [2021-12-17 08:55:26,160 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 27 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:55:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 08:55:26,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=70, Invalid=986, Unknown=0, NotChecked=0, Total=1056 [2021-12-17 08:55:26,161 INFO L933 BasicCegarLoop]: 1 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, 1 SdHoareTripleChecker+Invalid, 1 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 [2021-12-17 08:55:26,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:55:26,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:26,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-17 08:55:26,372 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@3a19d526 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-17 08:55:26,376 INFO L158 Benchmark]: Toolchain (without parser) took 138112.50ms. Allocated memory was 88.1MB in the beginning and 201.3MB in the end (delta: 113.2MB). Free memory was 55.6MB in the beginning and 76.9MB in the end (delta: -21.3MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2021-12-17 08:55:26,376 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 45.0MB in the beginning and 45.0MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 08:55:26,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.75ms. Allocated memory is still 88.1MB. Free memory was 55.4MB in the beginning and 56.3MB in the end (delta: -917.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 08:55:26,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.49ms. Allocated memory is still 88.1MB. Free memory was 56.3MB in the beginning and 54.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 08:55:26,377 INFO L158 Benchmark]: Boogie Preprocessor took 43.68ms. Allocated memory is still 88.1MB. Free memory was 54.1MB in the beginning and 52.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 08:55:26,377 INFO L158 Benchmark]: RCFGBuilder took 461.87ms. Allocated memory is still 88.1MB. Free memory was 52.5MB in the beginning and 38.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 08:55:26,377 INFO L158 Benchmark]: TraceAbstraction took 137131.29ms. Allocated memory was 88.1MB in the beginning and 201.3MB in the end (delta: 113.2MB). Free memory was 37.8MB in the beginning and 76.9MB in the end (delta: -39.1MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2021-12-17 08:55:26,378 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 45.0MB in the beginning and 45.0MB in the end (delta: 40.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.75ms. Allocated memory is still 88.1MB. Free memory was 55.4MB in the beginning and 56.3MB in the end (delta: -917.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.49ms. Allocated memory is still 88.1MB. Free memory was 56.3MB in the beginning and 54.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.68ms. Allocated memory is still 88.1MB. Free memory was 54.1MB in the beginning and 52.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 461.87ms. Allocated memory is still 88.1MB. Free memory was 52.5MB in the beginning and 38.2MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 137131.29ms. Allocated memory was 88.1MB in the beginning and 201.3MB in the end (delta: 113.2MB). Free memory was 37.8MB in the beginning and 76.9MB in the end (delta: -39.1MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@3a19d526 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@3a19d526: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-17 08:55:26,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:55:28,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:55:28,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:55:28,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:55:28,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:55:28,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:55:28,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:55:28,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:55:28,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:55:28,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:55:28,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:55:28,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:55:28,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:55:28,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:55:28,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:55:28,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:55:28,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:55:28,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:55:28,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:55:28,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:55:28,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:55:28,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:55:28,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:55:28,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:55:28,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:55:28,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:55:28,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:55:28,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:55:28,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:55:28,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:55:28,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:55:28,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:55:28,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:55:28,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:55:28,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:55:28,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:55:28,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:55:28,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:55:28,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:55:28,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:55:28,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:55:28,243 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 08:55:28,280 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:55:28,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:55:28,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:55:28,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:55:28,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:55:28,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:55:28,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:55:28,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:55:28,284 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:55:28,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:55:28,285 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:55:28,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:55:28,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:55:28,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:55:28,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:55:28,286 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:55:28,286 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 08:55:28,286 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 08:55:28,286 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 08:55:28,286 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:55:28,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:55:28,287 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:55:28,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:55:28,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:55:28,287 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:55:28,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:55:28,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:55:28,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:55:28,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:55:28,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:55:28,288 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 08:55:28,288 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 08:55:28,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:55:28,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:55:28,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:55:28,289 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:55:28,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 08:55:28,290 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2021-12-17 08:55:28,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:55:28,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:55:28,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:55:28,648 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:55:28,649 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:55:28,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2021-12-17 08:55:28,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31741e75c/d7b0e24f0438418a9f70c25ba9b41c6a/FLAGe5de2bf2f [2021-12-17 08:55:29,188 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:55:29,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2021-12-17 08:55:29,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31741e75c/d7b0e24f0438418a9f70c25ba9b41c6a/FLAGe5de2bf2f [2021-12-17 08:55:29,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31741e75c/d7b0e24f0438418a9f70c25ba9b41c6a [2021-12-17 08:55:29,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:55:29,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:55:29,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:55:29,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:55:29,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:55:29,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:55:29" (1/1) ... [2021-12-17 08:55:29,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c8de08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:29, skipping insertion in model container [2021-12-17 08:55:29,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:55:29" (1/1) ... [2021-12-17 08:55:29,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:55:29,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:55:29,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2021-12-17 08:55:29,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:55:29,985 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:55:30,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i[24457,24470] [2021-12-17 08:55:30,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:55:30,049 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:55:30,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30 WrapperNode [2021-12-17 08:55:30,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:55:30,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:55:30,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:55:30,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:55:30,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,095 INFO L137 Inliner]: procedures = 130, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2021-12-17 08:55:30,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:55:30,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:55:30,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:55:30,096 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:55:30,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:55:30,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:55:30,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:55:30,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:55:30,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (1/1) ... [2021-12-17 08:55:30,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:55:30,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:55:30,158 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) [2021-12-17 08:55:30,160 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 [2021-12-17 08:55:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 08:55:30,189 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 08:55:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:55:30,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:55:30,278 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:55:30,280 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:55:30,587 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:55:30,592 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:55:30,592 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 08:55:30,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:55:30 BoogieIcfgContainer [2021-12-17 08:55:30,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:55:30,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:55:30,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:55:30,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:55:30,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:55:29" (1/3) ... [2021-12-17 08:55:30,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cde20ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:55:30, skipping insertion in model container [2021-12-17 08:55:30,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:55:30" (2/3) ... [2021-12-17 08:55:30,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cde20ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:55:30, skipping insertion in model container [2021-12-17 08:55:30,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:55:30" (3/3) ... [2021-12-17 08:55:30,609 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2021-12-17 08:55:30,613 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:55:30,614 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 08:55:30,671 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:55:30,686 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 08:55:30,686 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 08:55:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:55:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 08:55:30,706 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:30,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:30,708 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2021-12-17 08:55:30,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:55:30,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596048786] [2021-12-17 08:55:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:30,726 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:55:30,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:55:30,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:55:30,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 08:55:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:30,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 08:55:30,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:30,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:55:30,960 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:55:30,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596048786] [2021-12-17 08:55:30,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596048786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:55:30,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:55:30,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 08:55:30,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104559483] [2021-12-17 08:55:30,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:55:30,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 08:55:30,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:55:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 08:55:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 08:55:30,996 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 08:55:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:31,013 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2021-12-17 08:55:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 08:55:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-17 08:55:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:31,020 INFO L225 Difference]: With dead ends: 65 [2021-12-17 08:55:31,020 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 08:55:31,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 08:55:31,024 INFO L933 BasicCegarLoop]: 46 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, 46 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 [2021-12-17 08:55:31,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:55:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 08:55:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 08:55:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:55:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-12-17 08:55:31,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2021-12-17 08:55:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:31,063 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-17 08:55:31,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 08:55:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2021-12-17 08:55:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 08:55:31,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:31,065 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:31,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 08:55:31,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:55:31,266 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:31,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2021-12-17 08:55:31,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:55:31,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76277917] [2021-12-17 08:55:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:31,268 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:55:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:55:31,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:55:31,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 08:55:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:31,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 08:55:31,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:31,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:55:31,413 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:55:31,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76277917] [2021-12-17 08:55:31,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76277917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:55:31,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:55:31,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:55:31,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057421327] [2021-12-17 08:55:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:55:31,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:55:31,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:55:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:55:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:55:31,416 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 08:55:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:31,430 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2021-12-17 08:55:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:55:31,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-17 08:55:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:31,431 INFO L225 Difference]: With dead ends: 58 [2021-12-17 08:55:31,431 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 08:55:31,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:55:31,433 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:31,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:55:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 08:55:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2021-12-17 08:55:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:55:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-17 08:55:31,440 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2021-12-17 08:55:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:31,440 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-17 08:55:31,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-17 08:55:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-12-17 08:55:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 08:55:31,441 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:31,441 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:31,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:31,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:55:31,658 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2021-12-17 08:55:31,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:55:31,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036801421] [2021-12-17 08:55:31,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:31,659 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:55:31,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:55:31,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:55:31,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 08:55:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:31,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 08:55:31,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:31,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 08:55:31,861 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:55:31,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036801421] [2021-12-17 08:55:31,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036801421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:55:31,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:55:31,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:55:31,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074946733] [2021-12-17 08:55:31,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:55:31,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:55:31,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:55:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:55:31,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:55:31,863 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:55:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:31,902 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2021-12-17 08:55:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:55:31,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2021-12-17 08:55:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:31,903 INFO L225 Difference]: With dead ends: 63 [2021-12-17 08:55:31,903 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 08:55:31,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:55:31,905 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:31,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:55:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 08:55:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-12-17 08:55:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:55:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2021-12-17 08:55:31,910 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2021-12-17 08:55:31,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:31,911 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2021-12-17 08:55:31,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 08:55:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2021-12-17 08:55:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-17 08:55:31,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:31,912 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:31,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:32,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:55:32,124 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2021-12-17 08:55:32,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:55:32,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588664493] [2021-12-17 08:55:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:32,126 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:55:32,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:55:32,127 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:55:32,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 08:55:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:32,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 08:55:32,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:32,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:55:32,392 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:55:32,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588664493] [2021-12-17 08:55:32,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588664493] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:55:32,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:55:32,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 08:55:32,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735895000] [2021-12-17 08:55:32,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:32,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:55:32,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:55:32,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:55:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:55:32,398 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 08:55:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:32,450 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2021-12-17 08:55:32,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 08:55:32,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2021-12-17 08:55:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:32,452 INFO L225 Difference]: With dead ends: 63 [2021-12-17 08:55:32,453 INFO L226 Difference]: Without dead ends: 40 [2021-12-17 08:55:32,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:55:32,459 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:32,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:55:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-17 08:55:32,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2021-12-17 08:55:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:55:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2021-12-17 08:55:32,471 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2021-12-17 08:55:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:32,472 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2021-12-17 08:55:32,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-17 08:55:32,472 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2021-12-17 08:55:32,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 08:55:32,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:32,475 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:32,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:32,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:55:32,688 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2021-12-17 08:55:32,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:55:32,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815198224] [2021-12-17 08:55:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:32,690 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:55:32,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:55:32,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:55:32,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 08:55:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:32,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 08:55:32,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:33,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-17 08:55:33,217 INFO L388 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 [2021-12-17 08:55:33,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:33,395 INFO L388 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 [2021-12-17 08:55:33,449 INFO L388 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 [2021-12-17 08:55:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:55:33,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:33,623 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:55:33,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815198224] [2021-12-17 08:55:33,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815198224] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:33,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294425567] [2021-12-17 08:55:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:33,624 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:55:33,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:55:33,649 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:55:33,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-12-17 08:55:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:33,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 08:55:33,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:34,428 INFO L388 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 [2021-12-17 08:55:34,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:34,533 INFO L388 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 [2021-12-17 08:55:34,612 INFO L388 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 [2021-12-17 08:55:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:55:34,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:34,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [294425567] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:34,736 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:55:34,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2021-12-17 08:55:34,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931417780] [2021-12-17 08:55:34,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:34,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-17 08:55:34,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:55:34,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-17 08:55:34,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=503, Unknown=7, NotChecked=0, Total=600 [2021-12-17 08:55:34,738 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 08:55:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:35,325 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2021-12-17 08:55:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 08:55:35,326 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2021-12-17 08:55:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:35,326 INFO L225 Difference]: With dead ends: 46 [2021-12-17 08:55:35,327 INFO L226 Difference]: Without dead ends: 36 [2021-12-17 08:55:35,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=140, Invalid=722, Unknown=8, NotChecked=0, Total=870 [2021-12-17 08:55:35,328 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:35,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 155 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 31 Unchecked, 0.4s Time] [2021-12-17 08:55:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-17 08:55:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-17 08:55:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:55:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2021-12-17 08:55:35,332 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 37 [2021-12-17 08:55:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:35,333 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2021-12-17 08:55:35,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 08:55:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2021-12-17 08:55:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 08:55:35,334 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:35,334 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:55:35,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:35,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:35,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:55:35,738 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2021-12-17 08:55:35,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:55:35,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664951405] [2021-12-17 08:55:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:35,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:55:35,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:55:35,740 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:55:35,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 08:55:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:35,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-17 08:55:35,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:36,000 INFO L388 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 [2021-12-17 08:55:36,341 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:55:36,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 08:55:36,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:55:36,513 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:36,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 57 [2021-12-17 08:55:36,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-17 08:55:36,851 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-17 08:55:36,852 INFO L388 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 58 treesize of output 38 [2021-12-17 08:55:36,860 INFO L388 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 [2021-12-17 08:55:36,867 INFO L388 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 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:55:37,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:37,124 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:37,125 INFO L388 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 64 treesize of output 56 [2021-12-17 08:55:37,171 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:55:37,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 08:55:37,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:37,188 INFO L388 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 14 treesize of output 16 [2021-12-17 08:55:37,354 INFO L388 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 [2021-12-17 08:55:37,529 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-17 08:55:37,530 INFO L388 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 60 treesize of output 32 [2021-12-17 08:55:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:37,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:37,932 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:55:37,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664951405] [2021-12-17 08:55:37,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664951405] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:37,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [545617914] [2021-12-17 08:55:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:37,932 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:55:37,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:55:37,934 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:55:37,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-17 08:55:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:38,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2021-12-17 08:55:38,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:38,451 INFO L388 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 [2021-12-17 08:55:38,880 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:55:38,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 08:55:39,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:55:39,150 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:39,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2021-12-17 08:55:39,621 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:39,622 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 29 [2021-12-17 08:55:39,627 INFO L388 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 [2021-12-17 08:55:39,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:39,799 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:39,800 INFO L388 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 64 treesize of output 56 [2021-12-17 08:55:39,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:39,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-17 08:55:39,837 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:55:39,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 08:55:40,026 INFO L388 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 [2021-12-17 08:55:40,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:40,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:55:40,211 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:40,211 INFO L388 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 62 treesize of output 26 [2021-12-17 08:55:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:40,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:40,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [545617914] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:40,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:55:40,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 37 [2021-12-17 08:55:40,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865046710] [2021-12-17 08:55:40,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:40,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-17 08:55:40,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:55:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-17 08:55:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1394, Unknown=6, NotChecked=0, Total=1560 [2021-12-17 08:55:40,502 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 37 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 30 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:55:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:41,549 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2021-12-17 08:55:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 08:55:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 30 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2021-12-17 08:55:41,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:41,551 INFO L225 Difference]: With dead ends: 67 [2021-12-17 08:55:41,551 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 08:55:41,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=259, Invalid=1990, Unknown=7, NotChecked=0, Total=2256 [2021-12-17 08:55:41,553 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 28 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:41,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 310 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 209 Invalid, 0 Unknown, 100 Unchecked, 0.5s Time] [2021-12-17 08:55:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 08:55:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2021-12-17 08:55:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:55:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2021-12-17 08:55:41,558 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 40 [2021-12-17 08:55:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:41,558 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2021-12-17 08:55:41,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 30 states have internal predecessors, (50), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:55:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2021-12-17 08:55:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-17 08:55:41,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:41,559 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-17 08:55:41,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:41,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:41,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:55:41,964 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1563025532, now seen corresponding path program 1 times [2021-12-17 08:55:41,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:55:41,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017501601] [2021-12-17 08:55:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:41,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:55:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:55:41,966 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:55:41,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-17 08:55:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:42,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-17 08:55:42,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:42,218 INFO L388 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 [2021-12-17 08:55:42,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 08:55:42,365 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:55:42,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 08:55:42,492 INFO L388 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 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:55:42,661 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 08:55:42,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-17 08:55:42,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:55:42,845 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:42,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2021-12-17 08:55:42,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-17 08:55:43,233 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:55:43,234 INFO L388 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 37 [2021-12-17 08:55:43,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:55:43,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2021-12-17 08:55:43,478 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:55:43,478 INFO L388 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 14 treesize of output 20 [2021-12-17 08:55:43,488 INFO L388 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 [2021-12-17 08:55:43,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:43,525 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:43,525 INFO L388 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 84 treesize of output 68 [2021-12-17 08:55:43,554 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 08:55:43,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 45 treesize of output 49 [2021-12-17 08:55:44,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:44,309 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:55:44,310 INFO L388 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 115 treesize of output 92 [2021-12-17 08:55:44,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:44,357 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-17 08:55:44,357 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2021-12-17 08:55:44,561 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:55:44,575 INFO L354 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2021-12-17 08:55:44,575 INFO L388 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 86 treesize of output 34 [2021-12-17 08:55:44,584 INFO L388 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 7 treesize of output 3 [2021-12-17 08:55:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:55:44,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:44,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_655) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_653))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_656) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-17 08:55:44,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_655) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_653))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_656) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:55:44,899 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_655) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_653))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_656) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:55:44,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_655) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_653))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_656) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_654) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:55:45,192 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:55:45,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017501601] [2021-12-17 08:55:45,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017501601] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:45,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1166427796] [2021-12-17 08:55:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:45,193 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:55:45,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:55:45,194 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:55:45,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2021-12-17 08:55:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:45,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-17 08:55:45,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:45,685 INFO L388 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 [2021-12-17 08:55:46,120 INFO L388 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 8 treesize of output 6 [2021-12-17 08:55:46,564 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:55:46,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 08:55:46,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:55:46,950 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:46,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2021-12-17 08:55:47,710 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:47,711 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2021-12-17 08:55:47,725 INFO L388 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 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:55:47,734 INFO L388 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 [2021-12-17 08:55:48,207 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:55:48,208 INFO L388 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 14 treesize of output 20 [2021-12-17 08:55:48,214 INFO L388 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 [2021-12-17 08:55:48,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:48,240 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:48,241 INFO L388 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 75 treesize of output 61 [2021-12-17 08:55:48,268 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:55:48,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2021-12-17 08:55:49,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:49,706 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:55:49,707 INFO L388 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 85 [2021-12-17 08:55:49,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:49,772 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-17 08:55:49,772 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 36 [2021-12-17 08:55:50,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:55:50,173 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:55:50,173 INFO L388 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 77 treesize of output 29 [2021-12-17 08:55:50,180 INFO L388 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 [2021-12-17 08:55:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:55:50,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:50,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_768 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_764) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_768))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2021-12-17 08:55:50,507 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_768 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_764) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_768))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_767) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:55:50,532 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_768 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_764) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_768))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_767) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:55:50,546 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_767 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_768 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_764) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_768))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_767) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:55:51,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1166427796] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:51,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:55:51,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2021-12-17 08:55:51,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432099081] [2021-12-17 08:55:51,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:55:51,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-17 08:55:51,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:55:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-17 08:55:51,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2658, Unknown=20, NotChecked=888, Total=3782 [2021-12-17 08:55:51,587 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:55:55,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:55:55,305 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2021-12-17 08:55:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 08:55:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2021-12-17 08:55:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:55:55,308 INFO L225 Difference]: With dead ends: 48 [2021-12-17 08:55:55,308 INFO L226 Difference]: Without dead ends: 45 [2021-12-17 08:55:55,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=395, Invalid=4447, Unknown=20, NotChecked=1144, Total=6006 [2021-12-17 08:55:55,310 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 42 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 08:55:55,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 350 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 172 Invalid, 0 Unknown, 128 Unchecked, 0.5s Time] [2021-12-17 08:55:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-17 08:55:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2021-12-17 08:55:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:55:55,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2021-12-17 08:55:55,316 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2021-12-17 08:55:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:55:55,316 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2021-12-17 08:55:55,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 40 states have internal predecessors, (69), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:55:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2021-12-17 08:55:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 08:55:55,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:55:55,318 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-12-17 08:55:55,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2021-12-17 08:55:55,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-17 08:55:55,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:55:55,726 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:55:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:55:55,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2021-12-17 08:55:55,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:55:55,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964672204] [2021-12-17 08:55:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:55,727 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:55:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:55:55,728 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:55:55,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-17 08:55:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:55,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 80 conjunts are in the unsatisfiable core [2021-12-17 08:55:55,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:55:56,011 INFO L388 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 [2021-12-17 08:55:56,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 08:55:56,134 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:55:56,134 INFO L388 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 20 treesize of output 27 [2021-12-17 08:55:56,275 INFO L388 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 18 treesize of output 14 [2021-12-17 08:55:56,451 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-17 08:55:56,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 46 [2021-12-17 08:55:56,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-17 08:55:56,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:56,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-17 08:55:56,659 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:55:56,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2021-12-17 08:55:56,667 INFO L388 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 20 treesize of output 22 [2021-12-17 08:55:56,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-12-17 08:55:57,056 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:55:57,056 INFO L388 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 77 treesize of output 40 [2021-12-17 08:55:57,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:55:57,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-17 08:55:57,074 INFO L388 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 [2021-12-17 08:55:57,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:57,338 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:55:57,338 INFO L388 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 83 treesize of output 71 [2021-12-17 08:55:57,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:57,348 INFO L388 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 18 treesize of output 20 [2021-12-17 08:55:57,378 INFO L354 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2021-12-17 08:55:57,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 49 [2021-12-17 08:55:57,409 INFO L388 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 14 treesize of output 16 [2021-12-17 08:55:58,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:58,245 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:55:58,245 INFO L388 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 127 [2021-12-17 08:55:58,281 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-17 08:55:58,281 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 58 [2021-12-17 08:55:58,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:58,299 INFO L388 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 37 treesize of output 37 [2021-12-17 08:55:58,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:58,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:55:58,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2021-12-17 08:55:58,510 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:55:58,510 INFO L388 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 75 treesize of output 34 [2021-12-17 08:55:58,516 INFO L388 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 15 treesize of output 7 [2021-12-17 08:55:58,656 INFO L388 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 [2021-12-17 08:55:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:55:58,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:55:58,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32)) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_892) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_893) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd |ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32)) |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 08:55:58,967 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_18| (_ BitVec 32)) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_892) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_893) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_891) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_18| (_ bv4 32)) |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 08:55:59,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_18| (_ BitVec 32)) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_892) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_893) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_891) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_18| (_ bv4 32)) |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 08:55:59,041 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_893 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_891 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_892 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_18| (_ BitVec 32)) (v_ArrVal_887 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_892) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_893) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_891) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_889) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_18| (_ bv4 32)) |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_887) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 08:55:59,477 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:55:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964672204] [2021-12-17 08:55:59,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964672204] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:55:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1043456709] [2021-12-17 08:55:59,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:55:59,477 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:55:59,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:55:59,478 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:55:59,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2021-12-17 08:55:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:55:59,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-17 08:55:59,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:00,068 INFO L388 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 [2021-12-17 08:56:00,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 08:56:00,898 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:00,899 INFO L388 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 20 treesize of output 27 [2021-12-17 08:56:01,036 INFO L388 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 13 treesize of output 9 [2021-12-17 08:56:01,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:01,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2021-12-17 08:56:01,206 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:56:01,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2021-12-17 08:56:01,211 INFO L388 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 20 treesize of output 22 [2021-12-17 08:56:01,906 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:56:01,906 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 35 [2021-12-17 08:56:01,911 INFO L388 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 7 treesize of output 3 [2021-12-17 08:56:01,916 INFO L388 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 18 treesize of output 14 [2021-12-17 08:56:01,922 INFO L388 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 [2021-12-17 08:56:02,145 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:56:02,145 INFO L388 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 14 treesize of output 20 [2021-12-17 08:56:02,154 INFO L388 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 [2021-12-17 08:56:02,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:02,186 INFO L354 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-17 08:56:02,186 INFO L388 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 74 treesize of output 64 [2021-12-17 08:56:02,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:02,200 INFO L388 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 18 treesize of output 20 [2021-12-17 08:56:02,222 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:56:02,222 INFO L388 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 35 treesize of output 37 [2021-12-17 08:56:03,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:03,255 INFO L354 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2021-12-17 08:56:03,255 INFO L388 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 105 [2021-12-17 08:56:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:03,294 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-12-17 08:56:03,294 INFO L388 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 57 [2021-12-17 08:56:03,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:03,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:03,310 INFO L388 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 35 treesize of output 39 [2021-12-17 08:56:03,590 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:56:03,591 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 29 [2021-12-17 08:56:03,597 INFO L388 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 [2021-12-17 08:56:03,724 INFO L388 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 [2021-12-17 08:56:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:56:03,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:03,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1015) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1017) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1014) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1019) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-17 08:56:03,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1017) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 08:56:03,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1017) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 08:56:03,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1019 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 32))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1015) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1017) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1014) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1013) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2021-12-17 08:56:04,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1043456709] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:04,443 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:56:04,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 49 [2021-12-17 08:56:04,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853609518] [2021-12-17 08:56:04,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:56:04,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-17 08:56:04,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 08:56:04,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-17 08:56:04,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2674, Unknown=15, NotChecked=888, Total=3782 [2021-12-17 08:56:04,445 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:56:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:56:08,407 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2021-12-17 08:56:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 08:56:08,411 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2021-12-17 08:56:08,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:56:08,412 INFO L225 Difference]: With dead ends: 55 [2021-12-17 08:56:08,412 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 08:56:08,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=385, Invalid=4602, Unknown=15, NotChecked=1160, Total=6162 [2021-12-17 08:56:08,415 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-17 08:56:08,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 443 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 338 Invalid, 0 Unknown, 163 Unchecked, 0.8s Time] [2021-12-17 08:56:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 08:56:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2021-12-17 08:56:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 08:56:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2021-12-17 08:56:08,421 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 44 [2021-12-17 08:56:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:56:08,421 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2021-12-17 08:56:08,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.425531914893617) internal successors, (67), 38 states have internal predecessors, (67), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 08:56:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2021-12-17 08:56:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-17 08:56:08,422 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:56:08,422 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:56:08,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:08,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-17 08:56:08,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 08:56:08,827 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:56:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:56:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash 705409183, now seen corresponding path program 2 times [2021-12-17 08:56:08,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 08:56:08,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37529131] [2021-12-17 08:56:08,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:56:08,828 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 08:56:08,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 08:56:08,830 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 08:56:08,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-17 08:56:09,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:56:09,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:56:09,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-17 08:56:09,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:09,152 INFO L388 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 [2021-12-17 08:56:09,243 INFO L388 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 13 treesize of output 9 [2021-12-17 08:56:09,505 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-17 08:56:09,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2021-12-17 08:56:09,515 INFO L388 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 16 treesize of output 18 [2021-12-17 08:56:09,575 INFO L388 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 13 treesize of output 9 [2021-12-17 08:56:09,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2021-12-17 08:56:09,599 INFO L388 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 16 treesize of output 18 [2021-12-17 08:56:09,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:09,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:56:09,696 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:56:09,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 49 [2021-12-17 08:56:09,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:09,702 INFO L388 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 22 treesize of output 24 [2021-12-17 08:56:10,034 INFO L354 Elim1Store]: treesize reduction 7, result has 78.8 percent of original size [2021-12-17 08:56:10,035 INFO L388 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 63 [2021-12-17 08:56:10,047 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:56:10,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:56:10,053 INFO L388 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 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-17 08:56:10,356 INFO L354 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2021-12-17 08:56:10,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 76 [2021-12-17 08:56:10,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:10,379 INFO L354 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2021-12-17 08:56:10,380 INFO L388 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 2 case distinctions, treesize of input 23 treesize of output 32 [2021-12-17 08:56:10,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:10,404 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-17 08:56:10,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2021-12-17 08:56:10,421 INFO L388 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 [2021-12-17 08:56:10,435 INFO L388 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 49 treesize of output 39 [2021-12-17 08:56:11,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:56:11,551 INFO L354 Elim1Store]: treesize reduction 281, result has 10.8 percent of original size [2021-12-17 08:56:11,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 235 treesize of output 118 [2021-12-17 08:56:11,630 INFO L354 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2021-12-17 08:56:11,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 394 treesize of output 203 [2021-12-17 08:56:11,682 INFO L354 Elim1Store]: treesize reduction 148, result has 16.9 percent of original size [2021-12-17 08:56:11,683 INFO L388 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 265 treesize of output 175 [2021-12-17 08:56:11,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:11,698 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:56:11,698 INFO L388 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 1 case distinctions, treesize of input 111 treesize of output 98 [2021-12-17 08:56:11,731 INFO L388 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 65 treesize of output 49 [2021-12-17 08:56:11,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:56:11,869 INFO L354 Elim1Store]: treesize reduction 50, result has 34.2 percent of original size [2021-12-17 08:56:11,870 INFO L388 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 65 [2021-12-17 08:56:11,878 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:56:11,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 18 [2021-12-17 08:56:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 08:56:11,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:56:12,031 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (v_ArrVal_1149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 32))) (not (= (_ bv0 32) (let ((.cse1 (bvadd |ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1146))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:56:12,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_26| (_ BitVec 32)) (v_ArrVal_1149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd |c_ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32)))) (.cse2 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_26| (_ bv4 32)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1146))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:56:12,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_26| (_ BitVec 32)) (v_ArrVal_1149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1146 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (let ((.cse3 (bvadd |c_ULTIMATE.start_dll_append_~last~0#1.offset| (_ bv4 32)))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse3) (_ bv4 32))))) (.cse2 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_26| (_ bv4 32)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1146))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1149) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))))) is different from false [2021-12-17 08:56:15,292 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 08:56:15,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37529131] [2021-12-17 08:56:15,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37529131] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:56:15,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [331133007] [2021-12-17 08:56:15,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 08:56:15,293 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 08:56:15,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 08:56:15,294 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 08:56:15,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2021-12-17 08:56:15,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 08:56:15,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 08:56:15,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-17 08:56:15,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:56:15,821 INFO L388 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 [2021-12-17 08:56:16,626 INFO L388 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 20 treesize of output 12 [2021-12-17 08:56:16,630 INFO L388 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 [2021-12-17 08:56:16,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-17 08:56:17,008 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-17 08:56:17,008 INFO L388 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 14 treesize of output 20 [2021-12-17 08:56:17,015 INFO L388 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 [2021-12-17 08:56:17,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:17,036 INFO L388 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 26 treesize of output 26 [2021-12-17 08:56:17,046 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-17 08:56:17,046 INFO L388 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 18 treesize of output 18 [2021-12-17 08:56:18,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:18,801 INFO L354 Elim1Store]: treesize reduction 159, result has 28.4 percent of original size [2021-12-17 08:56:18,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 145 [2021-12-17 08:56:18,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:18,860 INFO L354 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2021-12-17 08:56:18,860 INFO L388 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 164 treesize of output 142 [2021-12-17 08:56:18,974 INFO L354 Elim1Store]: treesize reduction 88, result has 29.6 percent of original size [2021-12-17 08:56:18,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 198 treesize of output 198 [2021-12-17 08:56:18,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:18,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:18,999 INFO L388 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 190 treesize of output 179 [2021-12-17 08:56:20,660 INFO L388 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 32 [2021-12-17 08:56:20,793 INFO L388 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 56 treesize of output 40 [2021-12-17 08:56:21,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2021-12-17 08:56:22,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:56:22,898 INFO L388 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 72 treesize of output 44 [2021-12-17 08:56:32,211 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-17 08:56:32,211 INFO L388 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 60 treesize of output 36 [2021-12-17 08:56:32,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 Killed by 15