./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_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/dll2c_insert_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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 08:40:15,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 08:40:15,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 08:40:15,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 08:40:15,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 08:40:15,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 08:40:15,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 08:40:15,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 08:40:15,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 08:40:15,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 08:40:15,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 08:40:15,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 08:40:15,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 08:40:15,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 08:40:15,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 08:40:15,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 08:40:15,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 08:40:15,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 08:40:15,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 08:40:15,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 08:40:15,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 08:40:15,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 08:40:15,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 08:40:15,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 08:40:15,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 08:40:15,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 08:40:15,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 08:40:15,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 08:40:15,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 08:40:15,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 08:40:15,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 08:40:15,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 08:40:15,514 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 08:40:15,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 08:40:15,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 08:40:15,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 08:40:15,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 08:40:15,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 08:40:15,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 08:40:15,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 08:40:15,518 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 08:40:15,519 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:40:15,541 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 08:40:15,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 08:40:15,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 08:40:15,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 08:40:15,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 08:40:15,543 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 08:40:15,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 08:40:15,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 08:40:15,544 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 08:40:15,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 08:40:15,545 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 08:40:15,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 08:40:15,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 08:40:15,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 08:40:15,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 08:40:15,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 08:40:15,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 08:40:15,546 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 08:40:15,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 08:40:15,546 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 08:40:15,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 08:40:15,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 08:40:15,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 08:40:15,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 08:40:15,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:40:15,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 08:40:15,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 08:40:15,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 08:40:15,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 08:40:15,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 08:40:15,549 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 08:40:15,549 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 08:40:15,549 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 08:40:15,549 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 08:40:15,549 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2021-12-17 08:40:15,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 08:40:15,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 08:40:15,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 08:40:15,785 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 08:40:15,785 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 08:40:15,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2021-12-17 08:40:15,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8ca29c0/f56c4682327d4d659a891acd9109bc59/FLAG483fb2be4 [2021-12-17 08:40:16,203 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 08:40:16,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2021-12-17 08:40:16,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8ca29c0/f56c4682327d4d659a891acd9109bc59/FLAG483fb2be4 [2021-12-17 08:40:16,575 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8ca29c0/f56c4682327d4d659a891acd9109bc59 [2021-12-17 08:40:16,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 08:40:16,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 08:40:16,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 08:40:16,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 08:40:16,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 08:40:16,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:16,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f34f12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16, skipping insertion in model container [2021-12-17 08:40:16,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:16,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 08:40:16,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 08:40:16,882 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/dll2c_insert_unequal.i[25148,25161] [2021-12-17 08:40:16,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:40:16,892 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 08:40:16,950 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/dll2c_insert_unequal.i[25148,25161] [2021-12-17 08:40:16,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 08:40:16,971 INFO L208 MainTranslator]: Completed translation [2021-12-17 08:40:16,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16 WrapperNode [2021-12-17 08:40:16,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 08:40:16,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 08:40:16,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 08:40:16,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 08:40:16,977 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:40:16" (1/1) ... [2021-12-17 08:40:16,989 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:40:16" (1/1) ... [2021-12-17 08:40:17,006 INFO L137 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 185 [2021-12-17 08:40:17,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 08:40:17,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 08:40:17,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 08:40:17,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 08:40:17,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:17,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:17,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:17,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:17,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:17,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:17,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:17,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 08:40:17,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 08:40:17,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 08:40:17,048 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 08:40:17,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (1/1) ... [2021-12-17 08:40:17,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 08:40:17,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:40:17,074 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:40:17,075 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:40:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 08:40:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 08:40:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-17 08:40:17,101 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-17 08:40:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-17 08:40:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 08:40:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 08:40:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-17 08:40:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-17 08:40:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 08:40:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-17 08:40:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 08:40:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 08:40:17,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 08:40:17,184 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 08:40:17,187 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 08:40:17,462 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 08:40:17,466 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 08:40:17,467 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-17 08:40:17,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:40:17 BoogieIcfgContainer [2021-12-17 08:40:17,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 08:40:17,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 08:40:17,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 08:40:17,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 08:40:17,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:40:16" (1/3) ... [2021-12-17 08:40:17,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ce4b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:40:17, skipping insertion in model container [2021-12-17 08:40:17,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:40:16" (2/3) ... [2021-12-17 08:40:17,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ce4b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:40:17, skipping insertion in model container [2021-12-17 08:40:17,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:40:17" (3/3) ... [2021-12-17 08:40:17,478 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2021-12-17 08:40:17,482 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 08:40:17,482 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 08:40:17,535 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 08:40:17,540 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:40:17,540 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 08:40:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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:40:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 08:40:17,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:17,568 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] [2021-12-17 08:40:17,569 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:17,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2021-12-17 08:40:17,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:17,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215591293] [2021-12-17 08:40:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:17,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:17,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:17,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 08:40:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:40:17,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:17,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215591293] [2021-12-17 08:40:17,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215591293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:40:17,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:40:17,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 08:40:17,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118735555] [2021-12-17 08:40:17,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:40:17,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 08:40:17,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:40:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 08:40:17,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 08:40:17,843 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:40:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:40:17,930 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2021-12-17 08:40:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 08:40:17,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2021-12-17 08:40:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:40:17,937 INFO L225 Difference]: With dead ends: 79 [2021-12-17 08:40:17,937 INFO L226 Difference]: Without dead ends: 36 [2021-12-17 08:40:17,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:40:17,943 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:40:17,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:40:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-12-17 08:40:17,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-12-17 08:40:17,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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:40:17,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2021-12-17 08:40:17,970 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2021-12-17 08:40:17,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:40:17,972 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2021-12-17 08:40:17,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:40:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2021-12-17 08:40:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 08:40:17,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:17,974 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] [2021-12-17 08:40:17,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 08:40:17,974 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2021-12-17 08:40:17,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:17,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407292184] [2021-12-17 08:40:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:17,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-17 08:40:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-17 08:40:18,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407292184] [2021-12-17 08:40:18,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407292184] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:40:18,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:40:18,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:40:18,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889823007] [2021-12-17 08:40:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:40:18,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:40:18,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:40:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:40:18,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:40:18,083 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:40:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:40:18,134 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2021-12-17 08:40:18,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:40:18,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 25 [2021-12-17 08:40:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:40:18,136 INFO L225 Difference]: With dead ends: 68 [2021-12-17 08:40:18,136 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 08:40:18,136 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:40:18,137 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:40:18,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:40:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 08:40:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2021-12-17 08:40:18,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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:40:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2021-12-17 08:40:18,143 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2021-12-17 08:40:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:40:18,144 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2021-12-17 08:40:18,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:40:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2021-12-17 08:40:18,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-17 08:40:18,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:18,145 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:40:18,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 08:40:18,145 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2021-12-17 08:40:18,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:18,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647927292] [2021-12-17 08:40:18,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:18,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:18,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:18,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:40:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:18,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-17 08:40:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:40:18,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:18,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647927292] [2021-12-17 08:40:18,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647927292] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:40:18,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:40:18,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 08:40:18,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222912617] [2021-12-17 08:40:18,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:40:18,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 08:40:18,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:40:18,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 08:40:18,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 08:40:18,306 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 08:40:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:40:18,381 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2021-12-17 08:40:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 08:40:18,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2021-12-17 08:40:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:40:18,383 INFO L225 Difference]: With dead ends: 67 [2021-12-17 08:40:18,385 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 08:40:18,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:40:18,386 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:40:18,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:40:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 08:40:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2021-12-17 08:40:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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:40:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2021-12-17 08:40:18,395 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2021-12-17 08:40:18,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:40:18,396 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-12-17 08:40:18,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 08:40:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2021-12-17 08:40:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-17 08:40:18,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:18,398 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:40:18,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 08:40:18,398 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2021-12-17 08:40:18,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:18,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89115581] [2021-12-17 08:40:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:18,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:19,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:40:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:19,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-17 08:40:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:40:19,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:19,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89115581] [2021-12-17 08:40:19,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89115581] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:40:19,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206068970] [2021-12-17 08:40:19,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:19,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:40:19,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:40:19,498 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:40:19,515 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:40:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:19,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 149 conjunts are in the unsatisfiable core [2021-12-17 08:40:19,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:40:20,008 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:40:20,094 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:40:20,260 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:40:20,264 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:40:20,422 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:40:20,495 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 11 treesize of output 7 [2021-12-17 08:40:20,503 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 17 treesize of output 22 [2021-12-17 08:40:20,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:20,621 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:40:20,622 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 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-17 08:40:20,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-17 08:40:20,748 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 19 treesize of output 18 [2021-12-17 08:40:20,830 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:40:20,837 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:40:21,084 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-12-17 08:40:21,085 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 2 case distinctions, treesize of input 102 treesize of output 59 [2021-12-17 08:40:21,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:21,100 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 26 treesize of output 23 [2021-12-17 08:40:21,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-12-17 08:40:21,353 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-17 08:40:21,354 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 100 treesize of output 42 [2021-12-17 08:40:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:21,362 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 16 treesize of output 10 [2021-12-17 08:40:21,368 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:40:21,371 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:40:21,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:21,612 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 08:40:21,612 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 108 treesize of output 88 [2021-12-17 08:40:21,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:21,618 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:40:21,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:21,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:21,647 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:40:21,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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:40:21,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:21,672 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:40:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:22,157 INFO L354 Elim1Store]: treesize reduction 152, result has 9.5 percent of original size [2021-12-17 08:40:22,157 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 6 new quantified variables, introduced 8 case distinctions, treesize of input 197 treesize of output 146 [2021-12-17 08:40:22,171 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 0 case distinctions, treesize of input 47 treesize of output 45 [2021-12-17 08:40:22,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:22,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:22,203 INFO L354 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2021-12-17 08:40:22,203 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2021-12-17 08:40:22,209 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2021-12-17 08:40:22,213 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 21 treesize of output 25 [2021-12-17 08:40:22,218 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 9 treesize of output 7 [2021-12-17 08:40:22,277 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 28 treesize of output 16 [2021-12-17 08:40:22,280 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:40:22,327 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:40:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:40:22,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:40:22,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_734 Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_734)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_731) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_726) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_733) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_732) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_724) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 08:40:22,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_734 Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_734)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_731) .cse0 v_ArrVal_726) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_733) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_730) .cse0 v_ArrVal_725) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_732) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_727) .cse0 v_ArrVal_724) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 08:40:22,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int)) (v_ArrVal_734 Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_734)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_731) .cse2 v_ArrVal_726) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_733) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_730) .cse2 v_ArrVal_725) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_732) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_727) .cse2 v_ArrVal_724) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2021-12-17 08:40:22,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int)) (v_ArrVal_744 (Array Int Int)) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_724 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| Int) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9|))) (= (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_745)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_744))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_743))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_734))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_731) .cse3 v_ArrVal_726) (select (select (store (store (store .cse4 .cse1 v_ArrVal_733) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_730) .cse3 v_ArrVal_725) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store .cse5 .cse1 v_ArrVal_732) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9| v_ArrVal_727) .cse3 v_ArrVal_724) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) |c_ULTIMATE.start_main_~data~0#1|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_9|))) is different from false [2021-12-17 08:40:22,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206068970] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:40:22,609 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:40:22,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2021-12-17 08:40:22,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349421763] [2021-12-17 08:40:22,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:40:22,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-17 08:40:22,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:40:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-17 08:40:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2111, Unknown=6, NotChecked=380, Total=2652 [2021-12-17 08:40:22,612 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 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:40:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:40:23,439 INFO L93 Difference]: Finished difference Result 103 states and 139 transitions. [2021-12-17 08:40:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-17 08:40:23,440 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 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 36 [2021-12-17 08:40:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:40:23,442 INFO L225 Difference]: With dead ends: 103 [2021-12-17 08:40:23,442 INFO L226 Difference]: Without dead ends: 69 [2021-12-17 08:40:23,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=208, Invalid=2664, Unknown=6, NotChecked=428, Total=3306 [2021-12-17 08:40:23,444 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-17 08:40:23,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 569 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 690 Invalid, 0 Unknown, 153 Unchecked, 0.5s Time] [2021-12-17 08:40:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-17 08:40:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2021-12-17 08:40:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 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:40:23,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2021-12-17 08:40:23,460 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 36 [2021-12-17 08:40:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:40:23,460 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2021-12-17 08:40:23,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 37 states have internal predecessors, (57), 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:40:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2021-12-17 08:40:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 08:40:23,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:23,461 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:40:23,486 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:40:23,673 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:40:23,674 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:23,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2021-12-17 08:40:23,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:23,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380675208] [2021-12-17 08:40:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:23,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:40:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:23,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-17 08:40:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:40:23,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:23,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380675208] [2021-12-17 08:40:23,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380675208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:40:23,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:40:23,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 08:40:23,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216487282] [2021-12-17 08:40:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:40:23,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 08:40:23,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:40:23,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 08:40:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 08:40:23,813 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 08:40:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:40:23,884 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2021-12-17 08:40:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 08:40:23,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2021-12-17 08:40:23,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:40:23,887 INFO L225 Difference]: With dead ends: 70 [2021-12-17 08:40:23,887 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 08:40:23,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:40:23,887 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:40:23,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:40:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 08:40:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-17 08:40:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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:40:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2021-12-17 08:40:23,892 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 37 [2021-12-17 08:40:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:40:23,893 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2021-12-17 08:40:23,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 08:40:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2021-12-17 08:40:23,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-17 08:40:23,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:23,894 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:40:23,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 08:40:23,894 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:23,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:23,894 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2021-12-17 08:40:23,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:23,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175958922] [2021-12-17 08:40:23,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:23,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:40:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-17 08:40:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:40:23,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:23,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175958922] [2021-12-17 08:40:23,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175958922] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 08:40:23,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 08:40:23,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 08:40:23,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725494218] [2021-12-17 08:40:23,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 08:40:23,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 08:40:23,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:40:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 08:40:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-17 08:40:23,974 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 08:40:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:40:24,031 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2021-12-17 08:40:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 08:40:24,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2021-12-17 08:40:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:40:24,034 INFO L225 Difference]: With dead ends: 71 [2021-12-17 08:40:24,034 INFO L226 Difference]: Without dead ends: 53 [2021-12-17 08:40:24,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-17 08:40:24,035 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 08:40:24,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 08:40:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-17 08:40:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-17 08:40:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 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:40:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2021-12-17 08:40:24,041 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 37 [2021-12-17 08:40:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:40:24,042 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2021-12-17 08:40:24,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-17 08:40:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2021-12-17 08:40:24,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 08:40:24,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:24,043 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:40:24,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-17 08:40:24,044 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:24,044 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2021-12-17 08:40:24,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:24,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789132267] [2021-12-17 08:40:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:24,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:40:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:24,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-17 08:40:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:40:24,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:24,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789132267] [2021-12-17 08:40:24,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789132267] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:40:24,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87096417] [2021-12-17 08:40:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:24,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:40:24,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:40:24,200 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:40:24,202 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:40:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:24,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 08:40:24,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:40:24,548 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:40:24,550 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:40:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:40:24,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:40:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-17 08:40:24,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87096417] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 08:40:24,658 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 08:40:24,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-12-17 08:40:24,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375334560] [2021-12-17 08:40:24,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 08:40:24,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 08:40:24,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:40:24,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 08:40:24,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-17 08:40:24,660 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 08:40:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:40:24,740 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2021-12-17 08:40:24,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 08:40:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-12-17 08:40:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:40:24,741 INFO L225 Difference]: With dead ends: 82 [2021-12-17 08:40:24,741 INFO L226 Difference]: Without dead ends: 67 [2021-12-17 08:40:24,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-17 08:40:24,742 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 08:40:24,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 181 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 08:40:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-17 08:40:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2021-12-17 08:40:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 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:40:24,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2021-12-17 08:40:24,748 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 38 [2021-12-17 08:40:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:40:24,756 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2021-12-17 08:40:24,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-17 08:40:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2021-12-17 08:40:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-17 08:40:24,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:24,757 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:40:24,775 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:40:24,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-17 08:40:24,975 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2021-12-17 08:40:24,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:24,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657170933] [2021-12-17 08:40:24,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:24,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:40:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:25,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-17 08:40:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:40:25,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:25,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657170933] [2021-12-17 08:40:25,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657170933] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:40:25,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652060019] [2021-12-17 08:40:25,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:25,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:40:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:40:25,228 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:40:25,229 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:40:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:25,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-17 08:40:25,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:40:25,701 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:40:25,745 WARN L860 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2621 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2621))) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2021-12-17 08:40:25,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:25,767 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:40:25,795 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:40:25,843 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2021-12-17 08:40:25,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:40:25,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2624 (Array Int Int)) (|v_node_create_~temp~0#1.base_19| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_2624) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (<= 1 .cse0) (<= |c_#StackHeapBarrier| |v_node_create_~temp~0#1.base_19|)))) is different from false [2021-12-17 08:40:25,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652060019] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:40:25,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 08:40:25,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2021-12-17 08:40:25,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584292133] [2021-12-17 08:40:25,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 08:40:25,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-17 08:40:25,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 08:40:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-17 08:40:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=622, Unknown=2, NotChecked=102, Total=812 [2021-12-17 08:40:25,928 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 08:40:26,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 08:40:26,253 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2021-12-17 08:40:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 08:40:26,254 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2021-12-17 08:40:26,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 08:40:26,254 INFO L225 Difference]: With dead ends: 67 [2021-12-17 08:40:26,255 INFO L226 Difference]: Without dead ends: 51 [2021-12-17 08:40:26,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1041, Unknown=2, NotChecked=134, Total=1332 [2021-12-17 08:40:26,255 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 66 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 08:40:26,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 290 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 206 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2021-12-17 08:40:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-17 08:40:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-17 08:40:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 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:40:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2021-12-17 08:40:26,261 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 38 [2021-12-17 08:40:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 08:40:26,262 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2021-12-17 08:40:26,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 08:40:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2021-12-17 08:40:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-17 08:40:26,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 08:40:26,263 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 08:40:26,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 08:40:26,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:40:26,465 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 08:40:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 08:40:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2021-12-17 08:40:26,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 08:40:26,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50478118] [2021-12-17 08:40:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:26,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 08:40:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-17 08:40:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:27,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-17 08:40:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-17 08:40:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-17 08:40:27,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 08:40:27,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50478118] [2021-12-17 08:40:27,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50478118] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 08:40:27,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349629354] [2021-12-17 08:40:27,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 08:40:27,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 08:40:27,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 08:40:27,351 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:40:27,353 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:40:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 08:40:28,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 189 conjunts are in the unsatisfiable core [2021-12-17 08:40:28,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 08:40:28,050 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:40:28,058 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:40:28,186 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:40:28,187 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:40:28,325 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:40:28,384 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 17 treesize of output 22 [2021-12-17 08:40:28,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:28,462 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-17 08:40:28,462 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 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-17 08:40:28,563 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 19 treesize of output 18 [2021-12-17 08:40:28,570 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 11 treesize of output 7 [2021-12-17 08:40:28,661 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-17 08:40:28,661 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 68 treesize of output 59 [2021-12-17 08:40:28,666 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:40:28,922 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-12-17 08:40:28,923 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 113 treesize of output 62 [2021-12-17 08:40:28,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:28,928 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 26 treesize of output 23 [2021-12-17 08:40:28,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2021-12-17 08:40:29,214 INFO L354 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2021-12-17 08:40:29,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 45 [2021-12-17 08:40:29,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:29,223 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 16 treesize of output 10 [2021-12-17 08:40:29,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:29,230 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 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-17 08:40:29,333 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 11 treesize of output 7 [2021-12-17 08:40:29,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:29,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:29,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:29,459 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 0 case distinctions, treesize of input 25 treesize of output 30 [2021-12-17 08:40:29,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:29,477 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-12-17 08:40:29,478 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 127 treesize of output 95 [2021-12-17 08:40:29,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:29,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:29,493 INFO L354 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-17 08:40:29,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 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:40:30,012 INFO L354 Elim1Store]: treesize reduction 116, result has 13.4 percent of original size [2021-12-17 08:40:30,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 275 treesize of output 163 [2021-12-17 08:40:30,057 INFO L354 Elim1Store]: treesize reduction 98, result has 14.0 percent of original size [2021-12-17 08:40:30,058 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 249 [2021-12-17 08:40:30,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:30,080 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 76 treesize of output 51 [2021-12-17 08:40:30,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:30,096 INFO L354 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2021-12-17 08:40:30,096 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 3 case distinctions, treesize of input 324 treesize of output 261 [2021-12-17 08:40:30,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:30,136 INFO L354 Elim1Store]: treesize reduction 178, result has 20.5 percent of original size [2021-12-17 08:40:30,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 277 treesize of output 254 [2021-12-17 08:40:30,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:30,155 INFO L354 Elim1Store]: treesize reduction 61, result has 7.6 percent of original size [2021-12-17 08:40:30,155 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 289 treesize of output 271 [2021-12-17 08:40:30,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 61 [2021-12-17 08:40:30,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-17 08:40:30,174 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 33 treesize of output 49 [2021-12-17 08:40:30,180 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 80 [2021-12-17 08:40:30,186 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 9 treesize of output 7 [2021-12-17 08:40:30,192 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 43 treesize of output 59 [2021-12-17 08:40:30,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:30,226 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-17 08:40:30,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 208 [2021-12-17 08:40:30,230 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 31 treesize of output 27 [2021-12-17 08:40:30,507 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-17 08:40:30,508 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 217 treesize of output 84 [2021-12-17 08:40:30,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:30,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-17 08:40:30,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2021-12-17 08:40:30,621 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:40:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 08:40:30,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 08:40:30,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2938 Int) (v_ArrVal_2953 (Array Int Int)) (v_ArrVal_2941 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2940 Int) (v_ArrVal_2937 (Array Int Int)) (v_ArrVal_2948 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2953) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2937)) (.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2948) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2941))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2952))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_ArrVal_2938) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_2940))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2956) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2021-12-17 08:40:30,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2938 Int) (v_ArrVal_2953 (Array Int Int)) (v_ArrVal_2941 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2940 Int) (v_ArrVal_2937 (Array Int Int)) (v_ArrVal_2948 (Array Int Int))) (= (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4)) (.cse2 (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse6 (store (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2953) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (select .cse8 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) .cse2 v_ArrVal_2937)) (.cse3 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2948) .cse2 v_ArrVal_2941))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2952))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse1 v_ArrVal_2938) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_2940))) .cse2 v_ArrVal_2956) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 8)))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2021-12-17 08:40:30,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2956 (Array Int Int)) (v_ArrVal_2938 Int) (v_ArrVal_2953 (Array Int Int)) (v_ArrVal_2941 (Array Int Int)) (v_ArrVal_2952 (Array Int Int)) (v_ArrVal_2940 Int) (v_ArrVal_2937 (Array Int Int)) (v_ArrVal_2948 (Array Int Int))) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse8 (select |c_#memory_$Pointer$.base| .cse2)) (.cse9 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4)) (.cse3 (select .cse8 .cse9))) (let ((.cse7 (store (let ((.cse10 (select |c_#memory_$Pointer$.offset| .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse10 .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2953) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 .cse9) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| (select .cse10 .cse9)))) .cse3 v_ArrVal_2937)) (.cse4 (store (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse8 .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2948) .cse3 v_ArrVal_2941))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| .cse2 v_ArrVal_2952))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse1 v_ArrVal_2938) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_2940))) .cse3 v_ArrVal_2956) (select (select .cse4 .cse5) .cse6)) (+ (select (select .cse7 .cse5) .cse6) 8))))))) |c_ULTIMATE.start_main_~uneq~0#1|)) is different from false [2021-12-17 08:40:30,906 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:40:30,906 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 623 treesize of output 616 [2021-12-17 08:40:30,922 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-17 08:40:30,923 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 81086 treesize of output 78335 [2021-12-17 08:40:30,984 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 150986 treesize of output 137786 [2021-12-17 08:40:31,039 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 137786 treesize of output 123386 Killed by 15