./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:49:06,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:49:06,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:49:06,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:49:06,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:49:06,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:49:06,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:49:06,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:49:06,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:49:06,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:49:06,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:49:06,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:49:06,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:49:06,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:49:06,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:49:06,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:49:06,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:49:06,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:49:06,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:49:06,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:49:06,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:49:06,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:49:06,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:49:06,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:49:06,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:49:06,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:49:06,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:49:06,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:49:06,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:49:06,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:49:06,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:49:06,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:49:06,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:49:06,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:49:06,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:49:06,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:49:06,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:49:06,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:49:06,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:49:06,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:49:06,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:49:06,388 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:49:06,419 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:49:06,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:49:06,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:49:06,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:49:06,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:49:06,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:49:06,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:49:06,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:49:06,422 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:49:06,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:49:06,423 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:49:06,423 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:49:06,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:49:06,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:49:06,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:49:06,424 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:49:06,424 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:49:06,424 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:49:06,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:49:06,424 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:49:06,424 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:49:06,425 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:49:06,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:49:06,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:49:06,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:49:06,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:49:06,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:49:06,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:49:06,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:49:06,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:49:06,426 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:49:06,427 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2021-12-14 19:49:06,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:49:06,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:49:06,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:49:06,674 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:49:06,674 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:49:06,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2021-12-14 19:49:06,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997a229fc/ece8363d226d48b5b5b808d103a671c0/FLAGd9cdabc58 [2021-12-14 19:49:07,228 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:49:07,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2021-12-14 19:49:07,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997a229fc/ece8363d226d48b5b5b808d103a671c0/FLAGd9cdabc58 [2021-12-14 19:49:07,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/997a229fc/ece8363d226d48b5b5b808d103a671c0 [2021-12-14 19:49:07,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:49:07,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:49:07,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:49:07,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:49:07,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:49:07,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:49:07" (1/1) ... [2021-12-14 19:49:07,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc25c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:07, skipping insertion in model container [2021-12-14 19:49:07,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:49:07" (1/1) ... [2021-12-14 19:49:07,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:49:07,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:49:08,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2021-12-14 19:49:08,012 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:49:08,017 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:49:08,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2021-12-14 19:49:08,073 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:49:08,100 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:49:08,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08 WrapperNode [2021-12-14 19:49:08,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:49:08,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:49:08,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:49:08,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:49:08,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,166 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2021-12-14 19:49:08,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:49:08,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:49:08,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:49:08,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:49:08,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:49:08,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:49:08,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:49:08,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:49:08,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (1/1) ... [2021-12-14 19:49:08,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:49:08,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:08,257 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-14 19:49:08,283 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-14 19:49:08,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:49:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:49:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-14 19:49:08,304 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-14 19:49:08,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:49:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:49:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:49:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:49:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:49:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:49:08,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:49:08,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:49:08,451 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:49:08,452 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:49:08,715 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:49:08,720 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:49:08,721 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-14 19:49:08,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:49:08 BoogieIcfgContainer [2021-12-14 19:49:08,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:49:08,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:49:08,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:49:08,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:49:08,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:49:07" (1/3) ... [2021-12-14 19:49:08,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8294b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:49:08, skipping insertion in model container [2021-12-14 19:49:08,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:49:08" (2/3) ... [2021-12-14 19:49:08,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8294b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:49:08, skipping insertion in model container [2021-12-14 19:49:08,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:49:08" (3/3) ... [2021-12-14 19:49:08,729 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2021-12-14 19:49:08,733 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:49:08,733 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-14 19:49:08,765 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:49:08,771 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-14 19:49:08,772 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-14 19:49:08,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:49:08,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:08,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:49:08,800 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2021-12-14 19:49:08,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:08,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170576102] [2021-12-14 19:49:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:08,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,000 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-14 19:49:09,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:09,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170576102] [2021-12-14 19:49:09,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170576102] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:09,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:09,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:49:09,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393075422] [2021-12-14 19:49:09,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:09,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:49:09,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:49:09,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:49:09,036 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:49:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:09,130 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-14 19:49:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:49:09,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:49:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:09,140 INFO L225 Difference]: With dead ends: 90 [2021-12-14 19:49:09,140 INFO L226 Difference]: Without dead ends: 87 [2021-12-14 19:49:09,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-14 19:49:09,148 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:09,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-14 19:49:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-14 19:49:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-14 19:49:09,189 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2021-12-14 19:49:09,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:09,189 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-14 19:49:09,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:49:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-14 19:49:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-14 19:49:09,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:09,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-14 19:49:09,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:49:09,191 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2021-12-14 19:49:09,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:09,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020622463] [2021-12-14 19:49:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:09,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,274 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-14 19:49:09,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020622463] [2021-12-14 19:49:09,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020622463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:09,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:09,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:49:09,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104851463] [2021-12-14 19:49:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:09,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:49:09,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:09,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:49:09,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:49:09,280 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:49:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:09,349 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-12-14 19:49:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:49:09,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-14 19:49:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:09,352 INFO L225 Difference]: With dead ends: 84 [2021-12-14 19:49:09,352 INFO L226 Difference]: Without dead ends: 84 [2021-12-14 19:49:09,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-14 19:49:09,357 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:09,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:49:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-14 19:49:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-14 19:49:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-14 19:49:09,368 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2021-12-14 19:49:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:09,371 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-14 19:49:09,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:49:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-14 19:49:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:49:09,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:09,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:09,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:49:09,374 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2021-12-14 19:49:09,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:09,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049626570] [2021-12-14 19:49:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:09,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,513 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-14 19:49:09,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:09,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049626570] [2021-12-14 19:49:09,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049626570] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:09,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:09,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:49:09,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833818823] [2021-12-14 19:49:09,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:09,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:49:09,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:49:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:49:09,516 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:49:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:09,577 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-14 19:49:09,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:49:09,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-12-14 19:49:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:09,579 INFO L225 Difference]: With dead ends: 95 [2021-12-14 19:49:09,579 INFO L226 Difference]: Without dead ends: 95 [2021-12-14 19:49:09,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:49:09,581 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:09,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-14 19:49:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-14 19:49:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-12-14 19:49:09,589 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2021-12-14 19:49:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:09,590 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-12-14 19:49:09,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:49:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-12-14 19:49:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:49:09,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:09,591 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:09,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:49:09,592 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2021-12-14 19:49:09,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:09,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94388330] [2021-12-14 19:49:09,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:09,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:49:09,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:09,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94388330] [2021-12-14 19:49:09,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94388330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:09,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:09,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:49:09,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545395170] [2021-12-14 19:49:09,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:09,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:49:09,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:09,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:49:09,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:49:09,741 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:09,913 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-14 19:49:09,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:09,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-14 19:49:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:09,918 INFO L225 Difference]: With dead ends: 105 [2021-12-14 19:49:09,918 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 19:49:09,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:09,924 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:09,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:49:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 19:49:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-12-14 19:49:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-14 19:49:09,930 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2021-12-14 19:49:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:09,930 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-14 19:49:09,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-14 19:49:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-14 19:49:09,931 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:09,931 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:09,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:49:09,932 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:09,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2021-12-14 19:49:09,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:09,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648194487] [2021-12-14 19:49:09,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:09,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:10,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:10,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:10,114 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:10,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648194487] [2021-12-14 19:49:10,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648194487] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:10,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:10,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:49:10,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819241954] [2021-12-14 19:49:10,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:10,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:49:10,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:49:10,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:49:10,119 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:10,261 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-14 19:49:10,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:10,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-12-14 19:49:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:10,264 INFO L225 Difference]: With dead ends: 84 [2021-12-14 19:49:10,264 INFO L226 Difference]: Without dead ends: 84 [2021-12-14 19:49:10,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:10,265 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:10,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-14 19:49:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-14 19:49:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-14 19:49:10,270 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2021-12-14 19:49:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:10,270 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-14 19:49:10,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-14 19:49:10,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:49:10,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:10,271 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:10,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:49:10,271 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:10,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:10,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2021-12-14 19:49:10,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:10,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492195310] [2021-12-14 19:49:10,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:10,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:10,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:10,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:10,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492195310] [2021-12-14 19:49:10,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492195310] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:10,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021672485] [2021-12-14 19:49:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:10,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:10,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:10,447 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-14 19:49:10,450 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-14 19:49:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:10,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:49:10,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:10,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:10,818 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:49:10,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:49:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:49:10,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:10,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021672485] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:10,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:49:10,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-14 19:49:10,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596949529] [2021-12-14 19:49:10,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:10,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:10,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:10,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:10,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:49:10,929 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:49:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:11,144 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2021-12-14 19:49:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:11,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2021-12-14 19:49:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:11,146 INFO L225 Difference]: With dead ends: 110 [2021-12-14 19:49:11,147 INFO L226 Difference]: Without dead ends: 110 [2021-12-14 19:49:11,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-14 19:49:11,150 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:11,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 420 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 37 Unchecked, 0.2s Time] [2021-12-14 19:49:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-14 19:49:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2021-12-14 19:49:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-14 19:49:11,167 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2021-12-14 19:49:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:11,167 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-14 19:49:11,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:49:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-14 19:49:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:49:11,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:11,168 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:11,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 19:49:11,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-14 19:49:11,372 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:11,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2021-12-14 19:49:11,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:11,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431025129] [2021-12-14 19:49:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:11,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:11,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:11,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431025129] [2021-12-14 19:49:11,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431025129] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:11,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276244606] [2021-12-14 19:49:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:11,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:11,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:11,627 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-14 19:49:11,642 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-14 19:49:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:11,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 19:49:11,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:11,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:12,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:12,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:49:12,050 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:12,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:49:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:49:12,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:12,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276244606] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:12,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:49:12,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-14 19:49:12,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852389890] [2021-12-14 19:49:12,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:12,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:49:12,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:12,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:49:12,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-14 19:49:12,208 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:49:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:12,519 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2021-12-14 19:49:12,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:49:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2021-12-14 19:49:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:12,520 INFO L225 Difference]: With dead ends: 90 [2021-12-14 19:49:12,521 INFO L226 Difference]: Without dead ends: 90 [2021-12-14 19:49:12,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-12-14 19:49:12,522 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:12,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 465 Invalid, 0 Unknown, 2 Unchecked, 0.3s Time] [2021-12-14 19:49:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-14 19:49:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2021-12-14 19:49:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-14 19:49:12,526 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2021-12-14 19:49:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:12,526 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-14 19:49:12,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:49:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-14 19:49:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:49:12,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:12,527 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:12,552 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-14 19:49:12,739 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-14 19:49:12,740 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2021-12-14 19:49:12,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:12,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611749778] [2021-12-14 19:49:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:12,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:12,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:12,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:12,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611749778] [2021-12-14 19:49:12,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611749778] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:12,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705478329] [2021-12-14 19:49:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:12,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:12,843 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-14 19:49:12,873 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-14 19:49:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:12,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:49:12,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:13,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:13,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705478329] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:13,126 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:13,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-14 19:49:13,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918915955] [2021-12-14 19:49:13,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:13,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:49:13,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:49:13,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:49:13,128 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:13,203 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-14 19:49:13,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:13,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-12-14 19:49:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:13,205 INFO L225 Difference]: With dead ends: 89 [2021-12-14 19:49:13,205 INFO L226 Difference]: Without dead ends: 89 [2021-12-14 19:49:13,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:13,206 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:13,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 436 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-14 19:49:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-12-14 19:49:13,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:13,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-14 19:49:13,209 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2021-12-14 19:49:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:13,210 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-14 19:49:13,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-14 19:49:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:49:13,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:13,211 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:13,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:13,425 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-14 19:49:13,425 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2021-12-14 19:49:13,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:13,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891677777] [2021-12-14 19:49:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:13,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:49:13,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:13,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891677777] [2021-12-14 19:49:13,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891677777] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:13,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540763688] [2021-12-14 19:49:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:13,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:13,511 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-14 19:49:13,513 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-14 19:49:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:13,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 19:49:13,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:49:13,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:13,692 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:49:13,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2021-12-14 19:49:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:49:13,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540763688] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:13,731 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:13,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2021-12-14 19:49:13,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520967605] [2021-12-14 19:49:13,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:13,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:49:13,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:13,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:49:13,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:49:13,732 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:49:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:13,846 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2021-12-14 19:49:13,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2021-12-14 19:49:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:13,847 INFO L225 Difference]: With dead ends: 113 [2021-12-14 19:49:13,848 INFO L226 Difference]: Without dead ends: 113 [2021-12-14 19:49:13,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:13,850 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:13,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-14 19:49:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2021-12-14 19:49:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2021-12-14 19:49:13,864 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2021-12-14 19:49:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:13,865 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2021-12-14 19:49:13,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:49:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2021-12-14 19:49:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:49:13,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:13,868 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:13,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-14 19:49:14,071 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-14 19:49:14,071 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:14,072 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2021-12-14 19:49:14,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:14,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269734133] [2021-12-14 19:49:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:14,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:14,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:14,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269734133] [2021-12-14 19:49:14,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269734133] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:14,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964636241] [2021-12-14 19:49:14,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:14,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:14,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:14,198 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-14 19:49:14,199 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-14 19:49:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:14,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 19:49:14,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:14,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:14,510 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:14,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2021-12-14 19:49:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:14,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964636241] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:14,648 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:14,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2021-12-14 19:49:14,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418240480] [2021-12-14 19:49:14,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:14,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 19:49:14,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 19:49:14,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:49:14,650 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-14 19:49:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:14,996 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-14 19:49:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:49:14,999 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2021-12-14 19:49:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:15,000 INFO L225 Difference]: With dead ends: 150 [2021-12-14 19:49:15,000 INFO L226 Difference]: Without dead ends: 150 [2021-12-14 19:49:15,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:49:15,001 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:15,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 752 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:49:15,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-14 19:49:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2021-12-14 19:49:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2021-12-14 19:49:15,007 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2021-12-14 19:49:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:15,007 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2021-12-14 19:49:15,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-14 19:49:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2021-12-14 19:49:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:49:15,008 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:15,009 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:15,040 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-14 19:49:15,223 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-14 19:49:15,223 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2021-12-14 19:49:15,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:15,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322541094] [2021-12-14 19:49:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:15,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:49:15,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:15,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322541094] [2021-12-14 19:49:15,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322541094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:15,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:15,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:49:15,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700358291] [2021-12-14 19:49:15,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:15,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:49:15,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:15,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:49:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:15,425 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:15,565 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-12-14 19:49:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:49:15,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-14 19:49:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:15,566 INFO L225 Difference]: With dead ends: 111 [2021-12-14 19:49:15,566 INFO L226 Difference]: Without dead ends: 111 [2021-12-14 19:49:15,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:49:15,567 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 135 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:15,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 294 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-14 19:49:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2021-12-14 19:49:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2021-12-14 19:49:15,570 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2021-12-14 19:49:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:15,570 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2021-12-14 19:49:15,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2021-12-14 19:49:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:49:15,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:15,571 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:15,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:49:15,571 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:15,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2021-12-14 19:49:15,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:15,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632173902] [2021-12-14 19:49:15,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:15,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:15,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:15,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632173902] [2021-12-14 19:49:15,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632173902] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:15,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:15,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-14 19:49:15,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250863091] [2021-12-14 19:49:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:15,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:49:15,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:15,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:49:15,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:49:15,701 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:15,835 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2021-12-14 19:49:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:49:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2021-12-14 19:49:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:15,836 INFO L225 Difference]: With dead ends: 89 [2021-12-14 19:49:15,836 INFO L226 Difference]: Without dead ends: 89 [2021-12-14 19:49:15,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:15,837 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 142 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:15,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 295 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-14 19:49:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-14 19:49:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2021-12-14 19:49:15,840 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2021-12-14 19:49:15,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:15,840 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2021-12-14 19:49:15,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2021-12-14 19:49:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:49:15,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:15,841 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:15,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:49:15,841 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:15,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2021-12-14 19:49:15,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:15,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569948214] [2021-12-14 19:49:15,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:15,842 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:49:15,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:15,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569948214] [2021-12-14 19:49:15,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569948214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:15,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:15,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:49:15,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384762732] [2021-12-14 19:49:15,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:15,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:15,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:15,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:15,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:15,959 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:16,240 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-12-14 19:49:16,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:49:16,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-12-14 19:49:16,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:16,241 INFO L225 Difference]: With dead ends: 158 [2021-12-14 19:49:16,242 INFO L226 Difference]: Without dead ends: 158 [2021-12-14 19:49:16,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:49:16,242 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 320 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:16,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 509 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:49:16,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-14 19:49:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2021-12-14 19:49:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 87 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-14 19:49:16,245 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2021-12-14 19:49:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:16,245 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-14 19:49:16,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-14 19:49:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:49:16,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:16,246 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:16,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:49:16,246 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:16,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2021-12-14 19:49:16,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:16,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395787888] [2021-12-14 19:49:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:16,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:16,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:16,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395787888] [2021-12-14 19:49:16,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395787888] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:16,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:16,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:49:16,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110700675] [2021-12-14 19:49:16,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:16,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:49:16,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:16,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:49:16,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:49:16,344 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:16,422 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2021-12-14 19:49:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:16,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-12-14 19:49:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:16,424 INFO L225 Difference]: With dead ends: 120 [2021-12-14 19:49:16,424 INFO L226 Difference]: Without dead ends: 120 [2021-12-14 19:49:16,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:16,425 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:16,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 270 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-14 19:49:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 95. [2021-12-14 19:49:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 90 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2021-12-14 19:49:16,444 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 35 [2021-12-14 19:49:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:16,445 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2021-12-14 19:49:16,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2021-12-14 19:49:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:49:16,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:16,446 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:16,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:49:16,446 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash 452746623, now seen corresponding path program 1 times [2021-12-14 19:49:16,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:16,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614934136] [2021-12-14 19:49:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:16,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:16,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:16,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614934136] [2021-12-14 19:49:16,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614934136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:16,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:16,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:49:16,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084704150] [2021-12-14 19:49:16,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:16,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:16,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:16,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:16,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:16,607 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:16,874 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2021-12-14 19:49:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:49:16,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2021-12-14 19:49:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:16,876 INFO L225 Difference]: With dead ends: 142 [2021-12-14 19:49:16,876 INFO L226 Difference]: Without dead ends: 142 [2021-12-14 19:49:16,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:49:16,877 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 315 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:16,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 530 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:49:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-14 19:49:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2021-12-14 19:49:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2021-12-14 19:49:16,879 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 35 [2021-12-14 19:49:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:16,880 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2021-12-14 19:49:16,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2021-12-14 19:49:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:49:16,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:16,880 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:16,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:49:16,881 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:16,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2021-12-14 19:49:16,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:16,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895472471] [2021-12-14 19:49:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:16,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:17,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:17,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:17,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895472471] [2021-12-14 19:49:17,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895472471] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:17,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028380617] [2021-12-14 19:49:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:17,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:17,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:17,220 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-14 19:49:17,247 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-14 19:49:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:17,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-14 19:49:17,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:17,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:17,507 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:17,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:49:17,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:49:17,594 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:17,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2021-12-14 19:49:17,671 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:17,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:49:17,713 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:49:17,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:49:17,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:49:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:49:17,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:18,016 INFO L354 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2021-12-14 19:49:18,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-14 19:49:18,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1578 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-14 19:49:18,031 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:18,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-14 19:49:18,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-14 19:49:18,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2021-12-14 19:49:18,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-14 19:49:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:49:18,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028380617] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:18,422 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:18,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 42 [2021-12-14 19:49:18,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182340790] [2021-12-14 19:49:18,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:18,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-14 19:49:18,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:18,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-14 19:49:18,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1595, Unknown=18, NotChecked=80, Total=1806 [2021-12-14 19:49:18,424 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-14 19:49:19,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:19,428 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2021-12-14 19:49:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:49:19,429 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2021-12-14 19:49:19,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:19,430 INFO L225 Difference]: With dead ends: 193 [2021-12-14 19:49:19,430 INFO L226 Difference]: Without dead ends: 193 [2021-12-14 19:49:19,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=285, Invalid=2563, Unknown=18, NotChecked=104, Total=2970 [2021-12-14 19:49:19,436 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 295 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:19,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 1330 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1079 Invalid, 0 Unknown, 328 Unchecked, 0.5s Time] [2021-12-14 19:49:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-14 19:49:19,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 105. [2021-12-14 19:49:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2021-12-14 19:49:19,441 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 38 [2021-12-14 19:49:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:19,441 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2021-12-14 19:49:19,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 35 states have internal predecessors, (75), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-14 19:49:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2021-12-14 19:49:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:49:19,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:19,445 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:19,471 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-14 19:49:19,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 19:49:19,667 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337164, now seen corresponding path program 1 times [2021-12-14 19:49:19,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:19,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998485777] [2021-12-14 19:49:19,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:19,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:20,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998485777] [2021-12-14 19:49:20,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998485777] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:20,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853037747] [2021-12-14 19:49:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:20,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:20,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:20,151 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-14 19:49:20,161 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-14 19:49:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:20,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-14 19:49:20,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:20,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:20,716 INFO L354 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2021-12-14 19:49:20,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2021-12-14 19:49:20,739 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:20,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:49:20,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:49:20,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:49:20,947 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:20,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2021-12-14 19:49:20,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:49:21,091 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:21,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:49:21,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:49:21,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:21,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:49:21,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:21,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:49:21,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:49:21,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:49:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:49:21,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:21,989 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:21,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2021-12-14 19:49:21,995 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:21,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-14 19:49:21,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2021-12-14 19:49:22,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 314 [2021-12-14 19:49:22,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 150 [2021-12-14 19:49:22,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 286 [2021-12-14 19:49:22,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 270 [2021-12-14 19:49:22,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 262 [2021-12-14 19:49:22,318 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:22,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-14 19:49:22,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:22,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:22,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2021-12-14 19:49:22,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853037747] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:22,583 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:49:22,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2021-12-14 19:49:22,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972911627] [2021-12-14 19:49:22,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:22,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-14 19:49:22,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:22,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-14 19:49:22,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2407, Unknown=2, NotChecked=0, Total=2550 [2021-12-14 19:49:22,585 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 33 states have internal predecessors, (62), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:49:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:24,676 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2021-12-14 19:49:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:49:24,677 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 33 states have internal predecessors, (62), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2021-12-14 19:49:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:24,678 INFO L225 Difference]: With dead ends: 216 [2021-12-14 19:49:24,678 INFO L226 Difference]: Without dead ends: 216 [2021-12-14 19:49:24,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=348, Invalid=3810, Unknown=2, NotChecked=0, Total=4160 [2021-12-14 19:49:24,680 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 1356 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 2219 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:24,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1356 Valid, 2219 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-14 19:49:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-14 19:49:24,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 113. [2021-12-14 19:49:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 108 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-14 19:49:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2021-12-14 19:49:24,683 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 38 [2021-12-14 19:49:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:24,684 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2021-12-14 19:49:24,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 33 states have internal predecessors, (62), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:49:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2021-12-14 19:49:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:49:24,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:24,684 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:24,704 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-14 19:49:24,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:24,896 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:24,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2021-12-14 19:49:24,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:24,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569642791] [2021-12-14 19:49:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:24,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:24,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:24,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:24,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-14 19:49:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:24,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 19:49:24,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:24,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569642791] [2021-12-14 19:49:24,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569642791] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:24,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154705053] [2021-12-14 19:49:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:24,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:24,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:24,982 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-14 19:49:24,994 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-14 19:49:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:49:25,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:49:25,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:49:25,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154705053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:25,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:49:25,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-14 19:49:25,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835685018] [2021-12-14 19:49:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:25,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:49:25,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:49:25,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:49:25,225 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:49:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:25,234 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2021-12-14 19:49:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:49:25,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2021-12-14 19:49:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:25,235 INFO L225 Difference]: With dead ends: 96 [2021-12-14 19:49:25,235 INFO L226 Difference]: Without dead ends: 96 [2021-12-14 19:49:25,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:49:25,235 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 126 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:25,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:49:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-14 19:49:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-14 19:49:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 92 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2021-12-14 19:49:25,238 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 41 [2021-12-14 19:49:25,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:25,239 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2021-12-14 19:49:25,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-14 19:49:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2021-12-14 19:49:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:49:25,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:25,241 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:25,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:25,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 19:49:25,466 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:25,466 INFO L85 PathProgramCache]: Analyzing trace with hash -784093497, now seen corresponding path program 2 times [2021-12-14 19:49:25,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:25,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751242970] [2021-12-14 19:49:25,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:25,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-14 19:49:25,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:25,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751242970] [2021-12-14 19:49:25,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751242970] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:25,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:25,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:49:25,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664240749] [2021-12-14 19:49:25,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:25,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:49:25,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:49:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:49:25,551 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:25,624 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2021-12-14 19:49:25,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:25,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2021-12-14 19:49:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:25,626 INFO L225 Difference]: With dead ends: 82 [2021-12-14 19:49:25,626 INFO L226 Difference]: Without dead ends: 82 [2021-12-14 19:49:25,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:49:25,627 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 150 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:25,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 158 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-14 19:49:25,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-14 19:49:25,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 78 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-12-14 19:49:25,630 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 41 [2021-12-14 19:49:25,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:25,630 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-12-14 19:49:25,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-12-14 19:49:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:49:25,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:25,631 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:25,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:49:25,631 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2032584715, now seen corresponding path program 1 times [2021-12-14 19:49:25,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:25,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422917807] [2021-12-14 19:49:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:25,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 19:49:25,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:25,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422917807] [2021-12-14 19:49:25,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422917807] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:25,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:25,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:49:25,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804796812] [2021-12-14 19:49:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:25,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:25,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:25,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:25,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:25,744 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:25,942 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2021-12-14 19:49:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:49:25,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-14 19:49:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:25,944 INFO L225 Difference]: With dead ends: 107 [2021-12-14 19:49:25,944 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 19:49:25,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:49:25,944 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 274 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:25,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 307 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 19:49:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2021-12-14 19:49:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 81 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2021-12-14 19:49:25,947 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 45 [2021-12-14 19:49:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:25,947 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2021-12-14 19:49:25,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2021-12-14 19:49:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:49:25,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:25,948 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:25,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-14 19:49:25,948 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2032584714, now seen corresponding path program 1 times [2021-12-14 19:49:25,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:25,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799366543] [2021-12-14 19:49:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:25,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:26,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:26,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:26,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:26,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799366543] [2021-12-14 19:49:26,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799366543] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:26,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797805097] [2021-12-14 19:49:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:26,046 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:26,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:26,047 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:49:26,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 19:49:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:26,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:49:26,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:26,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:26,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797805097] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:26,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:26,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-14 19:49:26,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688686490] [2021-12-14 19:49:26,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:26,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:49:26,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:49:26,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:49:26,407 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:49:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:26,464 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2021-12-14 19:49:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:49:26,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2021-12-14 19:49:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:26,467 INFO L225 Difference]: With dead ends: 107 [2021-12-14 19:49:26,467 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 19:49:26,468 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:49:26,469 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 183 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:26,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 203 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 19:49:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2021-12-14 19:49:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 97 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2021-12-14 19:49:26,474 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 45 [2021-12-14 19:49:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:26,474 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2021-12-14 19:49:26,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:49:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2021-12-14 19:49:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-14 19:49:26,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:26,475 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:26,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:26,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:26,679 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1454244195, now seen corresponding path program 1 times [2021-12-14 19:49:26,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:26,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343232373] [2021-12-14 19:49:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:26,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:26,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:26,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:26,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343232373] [2021-12-14 19:49:26,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343232373] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:26,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854247723] [2021-12-14 19:49:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:26,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:26,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:26,761 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:49:26,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 19:49:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:26,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:49:26,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:27,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:27,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854247723] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:27,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:27,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2021-12-14 19:49:27,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665602964] [2021-12-14 19:49:27,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:27,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:49:27,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:49:27,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:49:27,147 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:49:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:27,230 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2021-12-14 19:49:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:27,231 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-12-14 19:49:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:27,232 INFO L225 Difference]: With dead ends: 102 [2021-12-14 19:49:27,232 INFO L226 Difference]: Without dead ends: 102 [2021-12-14 19:49:27,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:49:27,232 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 212 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:27,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 230 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-14 19:49:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2021-12-14 19:49:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2021-12-14 19:49:27,235 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 46 [2021-12-14 19:49:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:27,235 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2021-12-14 19:49:27,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:49:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2021-12-14 19:49:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 19:49:27,236 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:27,236 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:27,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:27,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 19:49:27,443 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:27,444 INFO L85 PathProgramCache]: Analyzing trace with hash -748626798, now seen corresponding path program 2 times [2021-12-14 19:49:27,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:27,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884580961] [2021-12-14 19:49:27,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:27,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:49:27,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:27,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884580961] [2021-12-14 19:49:27,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884580961] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:27,546 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:27,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:49:27,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411491492] [2021-12-14 19:49:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:27,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:49:27,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:49:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:49:27,549 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:27,617 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2021-12-14 19:49:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2021-12-14 19:49:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:27,618 INFO L225 Difference]: With dead ends: 101 [2021-12-14 19:49:27,618 INFO L226 Difference]: Without dead ends: 101 [2021-12-14 19:49:27,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:49:27,619 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 88 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:27,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 239 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-14 19:49:27,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2021-12-14 19:49:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2021-12-14 19:49:27,622 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 50 [2021-12-14 19:49:27,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:27,622 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2021-12-14 19:49:27,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2021-12-14 19:49:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 19:49:27,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:27,623 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:27,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 19:49:27,624 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:27,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash -748626743, now seen corresponding path program 1 times [2021-12-14 19:49:27,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:27,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633440899] [2021-12-14 19:49:27,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:27,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:27,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:27,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-14 19:49:27,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:27,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633440899] [2021-12-14 19:49:27,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633440899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:27,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:27,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:49:27,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913526148] [2021-12-14 19:49:27,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:27,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:49:27,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:27,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:49:27,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:49:27,787 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:27,976 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2021-12-14 19:49:27,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:49:27,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2021-12-14 19:49:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:27,978 INFO L225 Difference]: With dead ends: 130 [2021-12-14 19:49:27,978 INFO L226 Difference]: Without dead ends: 130 [2021-12-14 19:49:27,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-14 19:49:27,979 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 378 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:27,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 337 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-14 19:49:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2021-12-14 19:49:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 91 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2021-12-14 19:49:27,982 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 50 [2021-12-14 19:49:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:27,983 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2021-12-14 19:49:27,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2021-12-14 19:49:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-14 19:49:27,984 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:27,984 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:27,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-14 19:49:27,984 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902980, now seen corresponding path program 1 times [2021-12-14 19:49:27,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:27,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11795295] [2021-12-14 19:49:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:27,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:28,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:28,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:28,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11795295] [2021-12-14 19:49:28,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11795295] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:28,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983144486] [2021-12-14 19:49:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:28,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:28,461 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:49:28,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 19:49:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:28,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-14 19:49:28,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:28,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:28,802 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:28,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:49:28,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:49:28,875 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:28,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2021-12-14 19:49:28,943 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:28,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:49:28,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:28,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:49:29,133 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:29,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:49:29,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:29,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:49:29,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:49:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-14 19:49:29,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:30,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_2989) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-14 19:49:30,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2989) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-14 19:49:30,500 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_2989) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1)) is different from false [2021-12-14 19:49:30,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2989) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2021-12-14 19:49:30,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2986 (Array Int Int)) (v_ArrVal_2988 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2986))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_2988))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2989))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2021-12-14 19:49:30,658 INFO L354 Elim1Store]: treesize reduction 5, result has 90.4 percent of original size [2021-12-14 19:49:30,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2021-12-14 19:49:30,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2986 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (v_ArrVal_2988 Int)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2985) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2986))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_2988))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2989))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-14 19:49:30,673 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:30,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 56 [2021-12-14 19:49:30,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 388 [2021-12-14 19:49:30,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:30,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 298 [2021-12-14 19:49:30,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:30,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 256 [2021-12-14 19:49:30,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:30,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 112 [2021-12-14 19:49:30,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 154 [2021-12-14 19:49:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2021-12-14 19:49:31,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983144486] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:31,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:31,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 25] total 54 [2021-12-14 19:49:31,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767286820] [2021-12-14 19:49:31,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:31,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-14 19:49:31,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:31,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-14 19:49:31,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2146, Unknown=57, NotChecked=594, Total=2970 [2021-12-14 19:49:31,225 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 55 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 48 states have internal predecessors, (111), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:49:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:32,087 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2021-12-14 19:49:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 19:49:32,087 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 48 states have internal predecessors, (111), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2021-12-14 19:49:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:32,088 INFO L225 Difference]: With dead ends: 158 [2021-12-14 19:49:32,088 INFO L226 Difference]: Without dead ends: 158 [2021-12-14 19:49:32,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=290, Invalid=3099, Unknown=57, NotChecked=714, Total=4160 [2021-12-14 19:49:32,091 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 318 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1105 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:32,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 1539 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1144 Invalid, 0 Unknown, 1105 Unchecked, 0.5s Time] [2021-12-14 19:49:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-14 19:49:32,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2021-12-14 19:49:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 99 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2021-12-14 19:49:32,097 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 53 [2021-12-14 19:49:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:32,097 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2021-12-14 19:49:32,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 48 states have internal predecessors, (111), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-14 19:49:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2021-12-14 19:49:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-14 19:49:32,099 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:32,099 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:32,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:32,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-14 19:49:32,317 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:32,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902981, now seen corresponding path program 1 times [2021-12-14 19:49:32,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:32,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980448197] [2021-12-14 19:49:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:32,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:32,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:33,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:33,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980448197] [2021-12-14 19:49:33,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980448197] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:33,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787668027] [2021-12-14 19:49:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:33,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:33,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:33,151 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:49:33,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 19:49:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:33,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-14 19:49:33,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:33,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:33,617 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:33,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:49:33,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:49:33,742 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:33,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-14 19:49:33,850 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:33,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-14 19:49:33,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:33,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-14 19:49:33,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:34,135 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:34,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-14 19:49:34,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:34,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-14 19:49:34,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:34,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2021-12-14 19:49:34,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:34,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2021-12-14 19:49:34,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2021-12-14 19:49:34,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 19:49:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:49:34,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:37,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_3197 Int) (v_ArrVal_3196 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3197) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3196) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_3197 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3197) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))))) is different from false [2021-12-14 19:49:37,222 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:37,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2021-12-14 19:49:46,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 132 [2021-12-14 19:49:46,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106 [2021-12-14 19:49:46,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2021-12-14 19:49:46,562 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3189) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) v_ArrVal_3190) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 Int) (v_ArrVal_3194 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3189))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) v_ArrVal_3190))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_3194) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3196) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2)))))))) is different from false [2021-12-14 19:49:46,610 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 Int) (v_ArrVal_3194 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3189))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3190))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_3194) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3196) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3189) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3190) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) is different from false [2021-12-14 19:49:46,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3189) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3190) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_3188 (Array Int Int)) (v_ArrVal_3189 (Array Int Int)) (v_ArrVal_3190 Int) (v_ArrVal_3194 (Array Int Int)) (v_ArrVal_3196 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3188) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3189))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_3190))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= .cse0 (select (store (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse2) .cse0 v_ArrVal_3194) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3196) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))))) is different from false [2021-12-14 19:49:46,680 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:46,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 96 [2021-12-14 19:49:46,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 765 treesize of output 739 [2021-12-14 19:49:46,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 653 treesize of output 635 [2021-12-14 19:49:46,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 530 treesize of output 518 [2021-12-14 19:49:46,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 430 [2021-12-14 19:49:46,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:46,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 246 [2021-12-14 19:49:46,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-14 19:49:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-14 19:49:47,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787668027] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:47,718 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:47,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 72 [2021-12-14 19:49:47,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163174707] [2021-12-14 19:49:47,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:47,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2021-12-14 19:49:47,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-12-14 19:49:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4464, Unknown=4, NotChecked=548, Total=5256 [2021-12-14 19:49:47,721 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 19:49:49,830 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#length| .cse0) 12) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (not (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select |c_#length| .cse1) 12) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_3197 Int) (v_ArrVal_3196 Int)) (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3197) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3196) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_3197 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3197) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select |c_#length| .cse3) 12) (not (= .cse3 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (not (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select |c_#length| .cse4) 12) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse4)) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-14 19:49:50,326 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select |c_#length| (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (= .cse0 12) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_3197 Int) (v_ArrVal_3196 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3197) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3196) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_3197 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_21| 8) v_ArrVal_3197) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))))) (= .cse2 0) (<= (+ .cse2 12) .cse0) (not (= (select .cse3 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (<= 0 (+ .cse2 8)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-14 19:49:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:52,085 INFO L93 Difference]: Finished difference Result 319 states and 356 transitions. [2021-12-14 19:49:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-14 19:49:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2021-12-14 19:49:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:52,094 INFO L225 Difference]: With dead ends: 319 [2021-12-14 19:49:52,094 INFO L226 Difference]: Without dead ends: 319 [2021-12-14 19:49:52,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 67 SyntacticMatches, 12 SemanticMatches, 99 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=652, Invalid=8296, Unknown=6, NotChecked=1146, Total=10100 [2021-12-14 19:49:52,097 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 1262 mSDsluCounter, 4624 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 4774 SdHoareTripleChecker+Invalid, 3599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1481 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:52,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 4774 Invalid, 3599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2073 Invalid, 0 Unknown, 1481 Unchecked, 0.9s Time] [2021-12-14 19:49:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-14 19:49:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 102. [2021-12-14 19:49:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2021-12-14 19:49:52,117 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 53 [2021-12-14 19:49:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:52,118 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2021-12-14 19:49:52,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 64 states have internal predecessors, (138), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 19:49:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2021-12-14 19:49:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-14 19:49:52,119 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:52,119 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:52,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:49:52,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-14 19:49:52,339 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1850823601, now seen corresponding path program 2 times [2021-12-14 19:49:52,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:52,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38510120] [2021-12-14 19:49:52,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:52,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:52,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:49:52,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38510120] [2021-12-14 19:49:52,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38510120] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:49:52,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:49:52,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:49:52,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601838800] [2021-12-14 19:49:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:49:52,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:49:52,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:49:52,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:49:52,494 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:49:52,595 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2021-12-14 19:49:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:49:52,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2021-12-14 19:49:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:49:52,597 INFO L225 Difference]: With dead ends: 88 [2021-12-14 19:49:52,597 INFO L226 Difference]: Without dead ends: 88 [2021-12-14 19:49:52,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:49:52,598 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 82 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:49:52,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 188 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:49:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-14 19:49:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-14 19:49:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 84 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:49:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2021-12-14 19:49:52,607 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 56 [2021-12-14 19:49:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:49:52,607 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2021-12-14 19:49:52,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-14 19:49:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2021-12-14 19:49:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-14 19:49:52,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:49:52,608 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:49:52,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-14 19:49:52,609 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:49:52,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:49:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1490386454, now seen corresponding path program 1 times [2021-12-14 19:49:52,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:49:52,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453097945] [2021-12-14 19:49:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:52,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:49:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:53,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:49:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:53,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:49:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:49:53,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:49:53,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453097945] [2021-12-14 19:49:53,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453097945] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:49:53,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016884121] [2021-12-14 19:49:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:49:53,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:49:53,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:49:53,622 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:49:53,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 19:49:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:49:53,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-14 19:49:53,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:49:53,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:54,125 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:49:54,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:49:54,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:49:54,288 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:54,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-14 19:49:54,404 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:54,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:49:54,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:49:54,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:54,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-12-14 19:49:54,816 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:49:54,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2021-12-14 19:49:54,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-14 19:49:54,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-14 19:49:55,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:55,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:55,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:55,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2021-12-14 19:49:55,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-14 19:49:55,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:55,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2021-12-14 19:49:55,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:49:55,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 50 [2021-12-14 19:49:55,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-12-14 19:49:55,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2021-12-14 19:49:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:49:56,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:49:56,487 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3520 Int) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3521 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ 1 (let ((.cse0 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3522) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_3520)) |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_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_3521)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3521 Int)) (<= (+ 1 (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3522) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_3520)) |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_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_3521)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))) is different from false [2021-12-14 19:49:56,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_3520 Int) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3521 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3522) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3521) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3521 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3522) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3521) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-14 19:49:56,596 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:56,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 92 [2021-12-14 19:49:56,621 INFO L354 Elim1Store]: treesize reduction 102, result has 28.2 percent of original size [2021-12-14 19:49:56,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 173 [2021-12-14 19:49:56,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 113 [2021-12-14 19:49:56,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 97 [2021-12-14 19:49:56,733 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (<= .cse0 .cse1) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (<= .cse1 .cse0))))) is different from false [2021-12-14 19:49:56,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse0 .cse1) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|)) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse1 .cse0))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-14 19:49:56,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse0 .cse1) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= .cse1 .cse0))))) is different from false [2021-12-14 19:49:56,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-14 19:49:56,979 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3518) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3518) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-12-14 19:49:57,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3518) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse0))) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3518) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-14 19:49:57,021 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:57,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 116 [2021-12-14 19:49:57,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:57,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 96 [2021-12-14 19:49:57,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3512 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-14 19:49:57,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3512 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-14 19:49:57,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3511 (Array Int Int)) (v_ArrVal_3512 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3511) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3512) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-14 19:49:57,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:49:57,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:49:57,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2021-12-14 19:49:57,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:49:57,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 144 [2021-12-14 19:49:57,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 171 [2021-12-14 19:49:57,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-14 19:49:57,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-14 19:49:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-14 19:49:57,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016884121] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:49:57,735 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:49:57,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29, 31] total 83 [2021-12-14 19:49:57,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296550557] [2021-12-14 19:49:57,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:49:57,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2021-12-14 19:49:57,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:49:57,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2021-12-14 19:49:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=4913, Unknown=11, NotChecked=1650, Total=6806 [2021-12-14 19:49:57,739 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 19:50:00,257 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= (select .cse0 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3518) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2))) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3518) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (<= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-14 19:50:02,261 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (= .cse0 (select .cse1 (+ |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 4))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3518) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3518) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (<= 0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0)))) is different from false [2021-12-14 19:50:04,265 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (<= |c_ULTIMATE.start_main_~len~0#1| .cse2) (<= .cse2 |c_ULTIMATE.start_main_~len~0#1|) (not (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= .cse3 (select .cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~len~0#1| .cse2) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-14 19:50:04,802 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse2 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (= .cse0 0) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) .cse0) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (not (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (not (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)) (= (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (= .cse3 (select .cse4 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse5 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse5 .cse6) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (= .cse7 (select (store (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= .cse6 .cse5))))) (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (= .cse2 (select .cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-14 19:50:05,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| 0) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|)) (= .cse2 0) (not (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (let ((.cse4 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse3 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse3 .cse4) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|)) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse4 .cse3))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (= .cse1 |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|) (= .cse1 (select .cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= .cse2 |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-14 19:50:05,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (= (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (= .cse1 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (= .cse1 0) (= .cse2 |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (not (= |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (= .cse2 (select .cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse5 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1)) (.cse4 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (<= .cse4 .cse5) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (forall ((v_prenex_13 Int) (v_ArrVal_3518 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3518) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_13) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_prenex_15 Int) (v_ArrVal_3517 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3517) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_prenex_15) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (<= .cse5 .cse4))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-14 19:50:05,901 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (select |c_#memory_int| .cse3)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_3520 Int) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3521 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3522) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3521) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3521 Int)) (<= (+ (let ((.cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3522) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_3521) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)) (= .cse4 0) (= (select .cse5 8) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= .cse3 (select .cse6 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (select .cse5 (+ .cse4 8)) 1)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))))) is different from false [2021-12-14 19:50:05,905 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse7 (select |c_#memory_int| .cse4))) (let ((.cse2 (+ (select .cse7 8) 1)) (.cse3 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_3520 Int) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3521 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3522) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_3521) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1))) (forall ((v_ArrVal_3520 Int) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3521 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3522) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3520) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_3521) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse2 .cse3) (not (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse3 .cse2) (= .cse5 0) (= .cse4 (select .cse6 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= .cse3 (+ (select .cse7 (+ .cse5 8)) 1)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))))) is different from false [2021-12-14 19:50:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:50:07,398 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2021-12-14 19:50:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-14 19:50:07,399 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 57 [2021-12-14 19:50:07,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:50:07,399 INFO L225 Difference]: With dead ends: 88 [2021-12-14 19:50:07,399 INFO L226 Difference]: Without dead ends: 88 [2021-12-14 19:50:07,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 61 SyntacticMatches, 8 SemanticMatches, 102 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=461, Invalid=6736, Unknown=19, NotChecked=3496, Total=10712 [2021-12-14 19:50:07,401 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 216 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 837 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:50:07,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 1610 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1290 Invalid, 0 Unknown, 837 Unchecked, 0.6s Time] [2021-12-14 19:50:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-14 19:50:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-14 19:50:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:50:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2021-12-14 19:50:07,404 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 57 [2021-12-14 19:50:07,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:50:07,405 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2021-12-14 19:50:07,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.7108433734939759) internal successors, (142), 74 states have internal predecessors, (142), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-14 19:50:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2021-12-14 19:50:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-14 19:50:07,407 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:50:07,407 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:50:07,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-14 19:50:07,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-14 19:50:07,631 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-14 19:50:07,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:50:07,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1792642665, now seen corresponding path program 1 times [2021-12-14 19:50:07,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:50:07,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256522952] [2021-12-14 19:50:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:07,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:50:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 19:50:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:07,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-14 19:50:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:07,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:50:07,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:50:07,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256522952] [2021-12-14 19:50:07,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256522952] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:50:07,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763769719] [2021-12-14 19:50:07,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:50:07,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:50:07,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:50:07,996 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:50:08,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 19:50:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:50:08,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-14 19:50:08,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:50:08,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-12-14 19:50:08,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 19:50:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-14 19:50:08,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:50:08,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2021-12-14 19:50:08,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:50:08,978 INFO L190 IndexEqualityManager]: detected not equals via solver