./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_insert_equal.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 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:10:57,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:10:57,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:10:58,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:10:58,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:10:58,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:10:58,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:10:58,068 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:10:58,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:10:58,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:10:58,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:10:58,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:10:58,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:10:58,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:10:58,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:10:58,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:10:58,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:10:58,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:10:58,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:10:58,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:10:58,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:10:58,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:10:58,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:10:58,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:10:58,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:10:58,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:10:58,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:10:58,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:10:58,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:10:58,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:10:58,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:10:58,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:10:58,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:10:58,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:10:58,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:10:58,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:10:58,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:10:58,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:10:58,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:10:58,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:10:58,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:10:58,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 12:10:58,149 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:10:58,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:10:58,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:10:58,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:10:58,152 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:10:58,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:10:58,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:10:58,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:10:58,153 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:10:58,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:10:58,154 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:10:58,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 12:10:58,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:10:58,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:10:58,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:10:58,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:10:58,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:10:58,156 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:10:58,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:10:58,156 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:10:58,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:10:58,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:10:58,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:10:58,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:10:58,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:10:58,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:10:58,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:10:58,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:10:58,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 12:10:58,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 12:10:58,160 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:10:58,160 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:10:58,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:10:58,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:10:58,161 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 -> 93d1510274ba16ddd1276e8e93ff0a644bf6fb4a262c4c9dde32fe8591d5ce8c [2021-12-21 12:10:58,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:10:58,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:10:58,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:10:58,446 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:10:58,447 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:10:58,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2021-12-21 12:10:58,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2e56d66/f83c6f179d24485088f4f29cb3402b54/FLAG0b1504ac8 [2021-12-21 12:10:59,053 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:10:59,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i [2021-12-21 12:10:59,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2e56d66/f83c6f179d24485088f4f29cb3402b54/FLAG0b1504ac8 [2021-12-21 12:10:59,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2e56d66/f83c6f179d24485088f4f29cb3402b54 [2021-12-21 12:10:59,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:10:59,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:10:59,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:10:59,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:10:59,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:10:59,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:10:59,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ff36f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59, skipping insertion in model container [2021-12-21 12:10:59,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:10:59,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:10:59,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:10:59,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i[24706,24719] [2021-12-21 12:10:59,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:10:59,825 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:10:59,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_equal.i[24706,24719] [2021-12-21 12:10:59,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:10:59,938 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:10:59,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59 WrapperNode [2021-12-21 12:10:59,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:10:59,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:10:59,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:10:59,943 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:10:59,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:10:59,983 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,017 INFO L137 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2021-12-21 12:11:00,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:11:00,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:11:00,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:11:00,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:11:00,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:11:00,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:11:00,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:11:00,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:11:00,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (1/1) ... [2021-12-21 12:11:00,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:11:00,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:00,144 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-21 12:11:00,147 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-21 12:11:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-21 12:11:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-21 12:11:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 12:11:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 12:11:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:11:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:11:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 12:11:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:11:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:11:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 12:11:00,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 12:11:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 12:11:00,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:11:00,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:11:00,363 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:11:00,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:11:00,412 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-21 12:11:00,686 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:11:00,694 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:11:00,696 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-21 12:11:00,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:11:00 BoogieIcfgContainer [2021-12-21 12:11:00,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:11:00,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:11:00,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:11:00,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:11:00,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:10:59" (1/3) ... [2021-12-21 12:11:00,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652e9376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:11:00, skipping insertion in model container [2021-12-21 12:11:00,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:10:59" (2/3) ... [2021-12-21 12:11:00,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652e9376 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:11:00, skipping insertion in model container [2021-12-21 12:11:00,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:11:00" (3/3) ... [2021-12-21 12:11:00,707 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_insert_equal.i [2021-12-21 12:11:00,714 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:11:00,714 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:11:00,772 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:11:00,779 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-21 12:11:00,780 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:11:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 30 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:00,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 12:11:00,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:00,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:00,815 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:00,820 INFO L85 PathProgramCache]: Analyzing trace with hash -504257564, now seen corresponding path program 1 times [2021-12-21 12:11:00,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:00,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131629853] [2021-12-21 12:11:00,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:00,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:01,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:01,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131629853] [2021-12-21 12:11:01,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131629853] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:01,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:01,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 12:11:01,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362578109] [2021-12-21 12:11:01,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:01,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 12:11:01,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 12:11:01,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 12:11:01,073 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 30 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:01,090 INFO L93 Difference]: Finished difference Result 56 states and 82 transitions. [2021-12-21 12:11:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 12:11:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 12:11:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:01,097 INFO L225 Difference]: With dead ends: 56 [2021-12-21 12:11:01,098 INFO L226 Difference]: Without dead ends: 23 [2021-12-21 12:11:01,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 12:11:01,103 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:01,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-21 12:11:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-21 12:11:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2021-12-21 12:11:01,134 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 15 [2021-12-21 12:11:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:01,134 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2021-12-21 12:11:01,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2021-12-21 12:11:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 12:11:01,136 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:01,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:01,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 12:11:01,138 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash 775432273, now seen corresponding path program 1 times [2021-12-21 12:11:01,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:01,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539223237] [2021-12-21 12:11:01,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:01,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:01,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:01,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539223237] [2021-12-21 12:11:01,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539223237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:01,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:01,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:11:01,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125436796] [2021-12-21 12:11:01,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:01,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:11:01,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:01,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:11:01,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:11:01,252 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:01,270 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2021-12-21 12:11:01,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:11:01,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 12:11:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:01,272 INFO L225 Difference]: With dead ends: 44 [2021-12-21 12:11:01,273 INFO L226 Difference]: Without dead ends: 28 [2021-12-21 12:11:01,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:11:01,278 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:01,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-21 12:11:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2021-12-21 12:11:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2021-12-21 12:11:01,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2021-12-21 12:11:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:01,295 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2021-12-21 12:11:01,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2021-12-21 12:11:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 12:11:01,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:01,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:01,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 12:11:01,301 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:01,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:01,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1038407807, now seen corresponding path program 1 times [2021-12-21 12:11:01,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:01,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130923723] [2021-12-21 12:11:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:01,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:01,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:01,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130923723] [2021-12-21 12:11:01,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130923723] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:01,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:01,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:11:01,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519127822] [2021-12-21 12:11:01,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:01,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:11:01,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:11:01,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:11:01,384 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:01,401 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2021-12-21 12:11:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:11:01,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-21 12:11:01,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:01,403 INFO L225 Difference]: With dead ends: 49 [2021-12-21 12:11:01,403 INFO L226 Difference]: Without dead ends: 28 [2021-12-21 12:11:01,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:11:01,404 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:01,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-21 12:11:01,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-21 12:11:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-21 12:11:01,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 20 [2021-12-21 12:11:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:01,409 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-21 12:11:01,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-12-21 12:11:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 12:11:01,410 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:01,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:01,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 12:11:01,411 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:01,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1976695811, now seen corresponding path program 1 times [2021-12-21 12:11:01,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:01,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542125394] [2021-12-21 12:11:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:01,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:01,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:01,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:01,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542125394] [2021-12-21 12:11:01,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542125394] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:01,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904992685] [2021-12-21 12:11:01,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:01,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:01,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:01,485 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-21 12:11:01,486 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-21 12:11:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:01,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:11:01,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:01,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:01,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904992685] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:11:01,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:11:01,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-21 12:11:01,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341482041] [2021-12-21 12:11:01,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:01,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 12:11:01,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 12:11:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 12:11:01,731 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:01,775 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2021-12-21 12:11:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:11:01,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-21 12:11:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:01,779 INFO L225 Difference]: With dead ends: 45 [2021-12-21 12:11:01,780 INFO L226 Difference]: Without dead ends: 29 [2021-12-21 12:11:01,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 12:11:01,783 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:01,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-21 12:11:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-21 12:11:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2021-12-21 12:11:01,794 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 20 [2021-12-21 12:11:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:01,794 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2021-12-21 12:11:01,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2021-12-21 12:11:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 12:11:01,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:01,796 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-21 12:11:01,827 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-21 12:11:02,012 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-21 12:11:02,013 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:02,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1871981809, now seen corresponding path program 1 times [2021-12-21 12:11:02,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:02,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982049443] [2021-12-21 12:11:02,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:02,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 12:11:02,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:02,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982049443] [2021-12-21 12:11:02,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982049443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:02,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:02,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:11:02,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478399086] [2021-12-21 12:11:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:02,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:11:02,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:02,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:11:02,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:11:02,144 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:02,161 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2021-12-21 12:11:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:11:02,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-21 12:11:02,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:02,166 INFO L225 Difference]: With dead ends: 44 [2021-12-21 12:11:02,166 INFO L226 Difference]: Without dead ends: 37 [2021-12-21 12:11:02,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:11:02,167 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:02,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-21 12:11:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2021-12-21 12:11:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-12-21 12:11:02,171 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2021-12-21 12:11:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:02,171 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-12-21 12:11:02,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-12-21 12:11:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 12:11:02,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:02,172 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:02,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 12:11:02,172 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:02,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash 835165646, now seen corresponding path program 1 times [2021-12-21 12:11:02,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:02,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910237810] [2021-12-21 12:11:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:02,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 12:11:02,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910237810] [2021-12-21 12:11:02,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910237810] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:02,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:11:02,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 12:11:02,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824837684] [2021-12-21 12:11:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:02,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 12:11:02,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:02,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 12:11:02,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 12:11:02,292 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:02,410 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2021-12-21 12:11:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 12:11:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-21 12:11:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:02,412 INFO L225 Difference]: With dead ends: 44 [2021-12-21 12:11:02,412 INFO L226 Difference]: Without dead ends: 41 [2021-12-21 12:11:02,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-21 12:11:02,413 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 77 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:02,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 84 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:11:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-21 12:11:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-12-21 12:11:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-21 12:11:02,417 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 26 [2021-12-21 12:11:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:02,418 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-21 12:11:02,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-21 12:11:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 12:11:02,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:02,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:02,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 12:11:02,419 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash 835167320, now seen corresponding path program 1 times [2021-12-21 12:11:02,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:02,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546126320] [2021-12-21 12:11:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:02,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:02,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:02,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546126320] [2021-12-21 12:11:02,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546126320] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:02,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813180516] [2021-12-21 12:11:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:02,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:02,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:02,487 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-21 12:11:02,509 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-21 12:11:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:02,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 12:11:02,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 12:11:02,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:11:02,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813180516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:02,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:11:02,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-21 12:11:02,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760619621] [2021-12-21 12:11:02,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:02,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:11:02,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:02,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:11:02,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 12:11:02,782 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:02,800 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2021-12-21 12:11:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:11:02,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-21 12:11:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:02,801 INFO L225 Difference]: With dead ends: 42 [2021-12-21 12:11:02,802 INFO L226 Difference]: Without dead ends: 32 [2021-12-21 12:11:02,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:11:02,803 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:02,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-21 12:11:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-21 12:11:02,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2021-12-21 12:11:02,808 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2021-12-21 12:11:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:02,809 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2021-12-21 12:11:02,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2021-12-21 12:11:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 12:11:02,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:02,810 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:02,837 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-21 12:11:03,030 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-21 12:11:03,031 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1615340901, now seen corresponding path program 1 times [2021-12-21 12:11:03,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:03,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416505914] [2021-12-21 12:11:03,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:03,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:03,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:03,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416505914] [2021-12-21 12:11:03,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416505914] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:03,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504616606] [2021-12-21 12:11:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:03,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:03,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:03,386 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-21 12:11:03,387 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-21 12:11:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:03,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 12:11:03,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:03,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:03,716 INFO L387 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 15 treesize of output 17 [2021-12-21 12:11:03,843 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-21 12:11:03,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2021-12-21 12:11:03,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:03,862 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-21 12:11:03,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 42 [2021-12-21 12:11:03,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:03,983 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-21 12:11:03,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 31 [2021-12-21 12:11:04,070 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:04,071 INFO L387 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 37 treesize of output 31 [2021-12-21 12:11:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:11:04,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:11:04,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504616606] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:04,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:11:04,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 20 [2021-12-21 12:11:04,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394435133] [2021-12-21 12:11:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:04,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 12:11:04,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 12:11:04,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-12-21 12:11:04,094 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:04,341 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2021-12-21 12:11:04,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 12:11:04,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-21 12:11:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:04,346 INFO L225 Difference]: With dead ends: 61 [2021-12-21 12:11:04,346 INFO L226 Difference]: Without dead ends: 37 [2021-12-21 12:11:04,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-12-21 12:11:04,347 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:04,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 78 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 110 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2021-12-21 12:11:04,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-21 12:11:04,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2021-12-21 12:11:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-21 12:11:04,352 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 26 [2021-12-21 12:11:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:04,352 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-21 12:11:04,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-12-21 12:11:04,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 12:11:04,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:04,353 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:04,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-21 12:11:04,559 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-21 12:11:04,560 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:04,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:04,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339227, now seen corresponding path program 1 times [2021-12-21 12:11:04,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:04,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926546742] [2021-12-21 12:11:04,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:04,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:05,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:05,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926546742] [2021-12-21 12:11:05,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926546742] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:05,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297113433] [2021-12-21 12:11:05,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:05,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:05,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:05,092 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-21 12:11:05,093 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-21 12:11:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:05,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-21 12:11:05,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:05,471 INFO L387 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-21 12:11:05,527 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:05,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:11:05,695 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-21 12:11:05,695 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-12-21 12:11:05,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:05,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:05,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:05,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-12-21 12:11:05,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:05,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-21 12:11:05,909 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:05,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2021-12-21 12:11:05,914 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-21 12:11:06,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,163 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:06,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-21 12:11:06,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,310 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:06,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2021-12-21 12:11:06,318 INFO L387 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-21 12:11:06,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,348 INFO L387 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-21 12:11:06,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:06,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,650 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:06,651 INFO L387 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 154 treesize of output 99 [2021-12-21 12:11:06,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,666 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:06,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 99 [2021-12-21 12:11:06,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,674 INFO L387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2021-12-21 12:11:06,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2021-12-21 12:11:06,687 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:06,783 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:06,783 INFO L387 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 93 treesize of output 81 [2021-12-21 12:11:06,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2021-12-21 12:11:06,796 INFO L387 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 18 treesize of output 20 [2021-12-21 12:11:06,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:06,867 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:06,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 27 [2021-12-21 12:11:06,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 12:11:06,911 INFO L387 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-21 12:11:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:06,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:06,964 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_962 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_962) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_963) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_965) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-21 12:11:06,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_952 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4))) (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 v_ArrVal_952)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_956) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_962) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_963) |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_insert_~snd_to_last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_954) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_965) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2021-12-21 12:11:07,028 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_952 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse0))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 v_ArrVal_952)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_956) .cse1 v_ArrVal_962) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse2 .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_958) .cse1 v_ArrVal_963) |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_insert_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_954) .cse1 v_ArrVal_965) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-12-21 12:11:07,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_952 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse0)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (select .cse3 .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_952)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_956) .cse2 v_ArrVal_962) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 (store .cse3 .cse1 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_958) .cse2 v_ArrVal_963) |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_960) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_954) .cse2 v_ArrVal_965) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-12-21 12:11:07,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_963 (Array Int Int)) (v_ArrVal_954 (Array Int Int)) (v_ArrVal_965 (Array Int Int)) (v_ArrVal_946 (Array Int Int)) (v_ArrVal_956 (Array Int Int)) (v_ArrVal_947 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_962 (Array Int Int)) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_947))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_946)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse5 (select .cse4 .cse1)) (.cse2 (+ 4 (select (select .cse6 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)))) (let ((.cse3 (select .cse5 .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_950))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_952))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_956) .cse3 v_ArrVal_962) (select (select (store (store (store .cse4 .cse1 (store .cse5 .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_958) .cse3 v_ArrVal_963) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store .cse6 .cse1 v_ArrVal_960) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_954) .cse3 v_ArrVal_965) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2021-12-21 12:11:07,147 INFO L387 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 75368 treesize of output 70956 [2021-12-21 12:11:07,298 INFO L387 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 70952 treesize of output 68748 [2021-12-21 12:11:07,379 INFO L387 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 68748 treesize of output 68620 [2021-12-21 12:11:07,447 INFO L387 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 68620 treesize of output 68108 [2021-12-21 12:11:07,518 INFO L387 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 68108 treesize of output 67852 [2021-12-21 12:11:07,610 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-21 12:11:07,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:11:07,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-12-21 12:11:07,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846779379] [2021-12-21 12:11:07,611 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:07,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-21 12:11:07,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:07,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-21 12:11:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1016, Unknown=5, NotChecked=340, Total=1482 [2021-12-21 12:11:07,613 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:08,713 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2021-12-21 12:11:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 12:11:08,713 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-21 12:11:08,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:08,714 INFO L225 Difference]: With dead ends: 56 [2021-12-21 12:11:08,714 INFO L226 Difference]: Without dead ends: 54 [2021-12-21 12:11:08,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=261, Invalid=1916, Unknown=5, NotChecked=470, Total=2652 [2021-12-21 12:11:08,715 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 121 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:08,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 89 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 12:11:08,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-21 12:11:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2021-12-21 12:11:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2021-12-21 12:11:08,721 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 26 [2021-12-21 12:11:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:08,721 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2021-12-21 12:11:08,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2021-12-21 12:11:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 12:11:08,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:08,722 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:08,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:08,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:08,931 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:08,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1613493859, now seen corresponding path program 1 times [2021-12-21 12:11:08,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:08,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914234870] [2021-12-21 12:11:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:08,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:09,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:09,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914234870] [2021-12-21 12:11:09,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914234870] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:09,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975400661] [2021-12-21 12:11:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:09,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:09,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:09,080 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:09,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 12:11:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:09,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 12:11:09,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:09,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:09,327 INFO L387 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 15 treesize of output 17 [2021-12-21 12:11:09,395 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-21 12:11:09,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2021-12-21 12:11:09,411 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-21 12:11:09,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 59 [2021-12-21 12:11:09,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-21 12:11:09,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-21 12:11:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:11:09,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:11:09,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975400661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:09,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:11:09,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 18 [2021-12-21 12:11:09,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935071744] [2021-12-21 12:11:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:09,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 12:11:09,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:09,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 12:11:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-12-21 12:11:09,456 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:09,617 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-12-21 12:11:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 12:11:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-21 12:11:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:09,619 INFO L225 Difference]: With dead ends: 47 [2021-12-21 12:11:09,619 INFO L226 Difference]: Without dead ends: 44 [2021-12-21 12:11:09,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2021-12-21 12:11:09,620 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 126 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:09,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 26 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:11:09,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-21 12:11:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2021-12-21 12:11:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:09,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2021-12-21 12:11:09,624 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 26 [2021-12-21 12:11:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:09,625 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2021-12-21 12:11:09,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2021-12-21 12:11:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 12:11:09,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:09,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:09,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:09,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 12:11:09,832 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:09,833 INFO L85 PathProgramCache]: Analyzing trace with hash 201100876, now seen corresponding path program 1 times [2021-12-21 12:11:09,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:09,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606997216] [2021-12-21 12:11:09,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:09,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:09,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606997216] [2021-12-21 12:11:09,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606997216] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869090379] [2021-12-21 12:11:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:09,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:09,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:09,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:09,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 12:11:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:10,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 12:11:10,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:10,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:10,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-21 12:11:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:10,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:10,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1281 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1281) |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 0))) is different from false [2021-12-21 12:11:10,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-12-21 12:11:10,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-21 12:11:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:10,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869090379] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:11:10,508 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:11:10,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2021-12-21 12:11:10,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850741577] [2021-12-21 12:11:10,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:11:10,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-21 12:11:10,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:10,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-21 12:11:10,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=515, Unknown=1, NotChecked=46, Total=650 [2021-12-21 12:11:10,509 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:10,727 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2021-12-21 12:11:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 12:11:10,727 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-21 12:11:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:10,728 INFO L225 Difference]: With dead ends: 46 [2021-12-21 12:11:10,728 INFO L226 Difference]: Without dead ends: 37 [2021-12-21 12:11:10,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=746, Unknown=1, NotChecked=58, Total=992 [2021-12-21 12:11:10,729 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:10,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 126 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2021-12-21 12:11:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-21 12:11:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-21 12:11:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2021-12-21 12:11:10,734 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 27 [2021-12-21 12:11:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:10,734 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2021-12-21 12:11:10,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2021-12-21 12:11:10,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-21 12:11:10,735 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:10,735 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:10,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:10,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:10,942 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:10,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2045561625, now seen corresponding path program 2 times [2021-12-21 12:11:10,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:10,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116083400] [2021-12-21 12:11:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:10,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:11,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:11,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116083400] [2021-12-21 12:11:11,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116083400] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:11,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535153878] [2021-12-21 12:11:11,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:11:11,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:11,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:11,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:11,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 12:11:11,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:11:11,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:11:11,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 12:11:11,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 12:11:11,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:11:11,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535153878] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:11:11,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:11:11,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2021-12-21 12:11:11,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016427532] [2021-12-21 12:11:11,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:11:11,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 12:11:11,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:11:11,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 12:11:11,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 12:11:11,272 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:11:11,288 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2021-12-21 12:11:11,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:11:11,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-21 12:11:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:11:11,289 INFO L225 Difference]: With dead ends: 42 [2021-12-21 12:11:11,289 INFO L226 Difference]: Without dead ends: 30 [2021-12-21 12:11:11,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:11:11,290 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:11:11,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 36 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:11:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-21 12:11:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-21 12:11:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-12-21 12:11:11,309 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2021-12-21 12:11:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:11:11,309 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-12-21 12:11:11,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:11:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-12-21 12:11:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 12:11:11,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:11:11,310 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:11:11,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 12:11:11,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:11,528 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:11:11,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:11:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1857769354, now seen corresponding path program 1 times [2021-12-21 12:11:11,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:11:11,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068680857] [2021-12-21 12:11:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:11,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:11:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 12:11:12,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:11:12,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068680857] [2021-12-21 12:11:12,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068680857] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:11:12,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059938864] [2021-12-21 12:11:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:11:12,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:11:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:11:12,076 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:11:12,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 12:11:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:11:12,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 94 conjunts are in the unsatisfiable core [2021-12-21 12:11:12,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:11:12,258 INFO L387 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-21 12:11:12,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-21 12:11:12,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,432 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 12:11:12,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2021-12-21 12:11:12,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-12-21 12:11:12,587 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:11:12,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2021-12-21 12:11:12,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,831 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2021-12-21 12:11:12,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2021-12-21 12:11:12,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,931 INFO L387 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 14 treesize of output 16 [2021-12-21 12:11:12,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:12,943 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2021-12-21 12:11:12,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 67 [2021-12-21 12:11:13,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:13,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:13,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:13,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:11:13,295 INFO L353 Elim1Store]: treesize reduction 131, result has 39.4 percent of original size [2021-12-21 12:11:13,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 126 treesize of output 139 [2021-12-21 12:11:13,315 INFO L353 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-21 12:11:13,316 INFO L387 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 24 treesize of output 26 [2021-12-21 12:11:13,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:13,336 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-21 12:11:13,336 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2021-12-21 12:11:13,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-21 12:11:14,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:11:14,863 INFO L353 Elim1Store]: treesize reduction 158, result has 43.6 percent of original size [2021-12-21 12:11:14,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 276 treesize of output 261 [2021-12-21 12:11:14,912 INFO L353 Elim1Store]: treesize reduction 96, result has 27.8 percent of original size [2021-12-21 12:11:14,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 72 [2021-12-21 12:11:26,211 INFO L353 Elim1Store]: treesize reduction 37, result has 39.3 percent of original size [2021-12-21 12:11:26,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 347 treesize of output 343 [2021-12-21 12:11:34,352 INFO L353 Elim1Store]: treesize reduction 94, result has 42.3 percent of original size [2021-12-21 12:11:34,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 369 treesize of output 237 [2021-12-21 12:11:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:11:34,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:11:47,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_1635 Int) (v_ArrVal_1638 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_19| Int)) (not (= (let ((.cse5 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse6 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse2 (select .cse5 .cse6)) (.cse3 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_19| 8))) (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse5 .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8) v_ArrVal_1635) (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4) .cse2))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1638))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 0))) is different from false [2021-12-21 12:11:47,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1635 Int) (v_ArrVal_1638 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_19| Int)) (not (= (let ((.cse5 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse6 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse2 (select .cse5 .cse6)) (.cse3 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_19| 8))) (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse5 .cse6 |c_ULTIMATE.start_node_create_#res#1.base|)))) (store .cse4 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse4 |c_ULTIMATE.start_node_create_#res#1.base|) (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|) v_ArrVal_1635) (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4) .cse2))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_node_create_#res#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse6 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1638))) (store .cse7 .cse2 (store (select .cse7 .cse2) .cse3 |c_ULTIMATE.start_node_create_#res#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 0))) is different from false [2021-12-21 12:11:47,778 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (v_ArrVal_1635 Int) (v_ArrVal_1628 (Array Int Int)) (v_ArrVal_1627 (Array Int Int)) (v_ArrVal_1638 (Array Int Int)) (|v_ULTIMATE.start_dll_insert_~last~0#1.offset_19| Int)) (not (= (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1628))) (let ((.cse6 (select .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse7 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse2 (select .cse6 .cse7)) (.cse3 (+ |v_ULTIMATE.start_dll_insert_~last~0#1.offset_19| 8))) (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (store .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse6 .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) v_ArrVal_1635) (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) .cse2))))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.base|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1627))) (store .cse9 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1638))) (store .cse8 .cse2 (store (select .cse8 .cse2) .cse3 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 0))) is different from false [2021-12-21 12:11:47,856 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:11:47,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 330715 treesize of output 328635 [2021-12-21 12:11:47,960 INFO L387 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 383306 treesize of output 382378 [2021-12-21 12:11:48,098 INFO L387 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 480738 treesize of output 480170 [2021-12-21 12:11:49,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 12:11:49,411 INFO L387 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 287 treesize of output 283 [2021-12-21 12:11:49,478 INFO L387 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 287 treesize of output 283 [2021-12-21 12:11:49,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 12:11:49,635 INFO L387 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 875 treesize of output 871 [2021-12-21 12:11:50,081 INFO L387 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 287 treesize of output 283 [2021-12-21 12:11:50,135 INFO L387 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 287 treesize of output 283 [2021-12-21 12:12:02,650 WARN L227 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 173 DAG size of output: 119 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-21 12:12:02,651 INFO L353 Elim1Store]: treesize reduction 342, result has 43.4 percent of original size [2021-12-21 12:12:02,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 9 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 1266 treesize of output 803 [2021-12-21 12:12:02,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:02,970 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 12:12:02,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2021-12-21 12:12:03,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:03,136 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:03,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-12-21 12:12:03,329 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:03,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-12-21 12:12:03,656 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:03,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-12-21 12:12:03,840 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:03,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-12-21 12:12:03,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:03,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-12-21 12:12:04,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:04,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:04,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:04,575 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:04,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 12:12:04,621 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 12:12:04,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11 [2021-12-21 12:12:04,671 INFO L353 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-12-21 12:12:04,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2021-12-21 12:12:04,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:05,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:05,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:05,574 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:05,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-12-21 12:12:05,676 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:05,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-12-21 12:12:05,737 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:12:05,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-12-21 12:12:05,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:06,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:06,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-12-21 12:12:06,500 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-21 12:12:06,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 11