./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_update_all.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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:15:32,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:15:32,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:15:32,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:15:32,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:15:32,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:15:32,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:15:32,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:15:32,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:15:32,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:15:32,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:15:32,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:15:32,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:15:32,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:15:32,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:15:32,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:15:32,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:15:32,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:15:32,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:15:32,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:15:32,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:15:32,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:15:32,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:15:32,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:15:32,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:15:32,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:15:32,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:15:32,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:15:32,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:15:32,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:15:32,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:15:32,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:15:32,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:15:32,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:15:32,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:15:32,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:15:32,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:15:32,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:15:32,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:15:32,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:15:32,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:15:32,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-21 18:15:32,204 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:15:32,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:15:32,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:15:32,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:15:32,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:15:32,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:15:32,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:15:32,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:15:32,206 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:15:32,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:15:32,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:15:32,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:15:32,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:15:32,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:15:32,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:15:32,207 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:15:32,207 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:15:32,207 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:15:32,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:15:32,208 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:15:32,208 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:15:32,208 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:15:32,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:15:32,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:15:32,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:15:32,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:15:32,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:15:32,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:15:32,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:15:32,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:15:32,209 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:15:32,209 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2021-12-21 18:15:32,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:15:32,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:15:32,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:15:32,415 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:15:32,415 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:15:32,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-21 18:15:32,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c793de712/0927dcd3df1742aeb00c216b2811e036/FLAG7553a3cd6 [2021-12-21 18:15:32,902 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:15:32,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-21 18:15:32,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c793de712/0927dcd3df1742aeb00c216b2811e036/FLAG7553a3cd6 [2021-12-21 18:15:32,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c793de712/0927dcd3df1742aeb00c216b2811e036 [2021-12-21 18:15:32,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:15:32,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:15:32,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:15:32,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:15:32,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:15:32,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:15:32" (1/1) ... [2021-12-21 18:15:32,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68eee4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:32, skipping insertion in model container [2021-12-21 18:15:32,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:15:32" (1/1) ... [2021-12-21 18:15:32,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:15:32,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:15:33,255 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.i[24538,24551] [2021-12-21 18:15:33,258 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:15:33,264 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:15:33,299 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.i[24538,24551] [2021-12-21 18:15:33,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:15:33,322 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:15:33,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33 WrapperNode [2021-12-21 18:15:33,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:15:33,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:15:33,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:15:33,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:15:33,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,357 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2021-12-21 18:15:33,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:15:33,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:15:33,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:15:33,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:15:33,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:15:33,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:15:33,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:15:33,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:15:33,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (1/1) ... [2021-12-21 18:15:33,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:15:33,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:33,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 18:15:33,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 18:15:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 18:15:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 18:15:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 18:15:33,450 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 18:15:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:15:33,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:15:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:15:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:15:33,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:15:33,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 18:15:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:15:33,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:15:33,559 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:15:33,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:15:33,788 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:15:33,793 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:15:33,794 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-21 18:15:33,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:15:33 BoogieIcfgContainer [2021-12-21 18:15:33,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:15:33,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:15:33,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:15:33,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:15:33,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:15:32" (1/3) ... [2021-12-21 18:15:33,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483550fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:15:33, skipping insertion in model container [2021-12-21 18:15:33,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:15:33" (2/3) ... [2021-12-21 18:15:33,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483550fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:15:33, skipping insertion in model container [2021-12-21 18:15:33,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:15:33" (3/3) ... [2021-12-21 18:15:33,801 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-12-21 18:15:33,804 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:15:33,804 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-21 18:15:33,834 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:15:33,839 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-21 18:15:33,839 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-21 18:15:33,854 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-21 18:15:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-21 18:15:33,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:33,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-21 18:15:33,868 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-21 18:15:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2021-12-21 18:15:33,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:33,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269807423] [2021-12-21 18:15:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:33,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:15:34,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:34,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269807423] [2021-12-21 18:15:34,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269807423] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:34,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:34,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:15:34,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811890897] [2021-12-21 18:15:34,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:34,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:15:34,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:34,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:15:34,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:15:34,107 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-21 18:15:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:34,193 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-21 18:15:34,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:15:34,195 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-21 18:15:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:34,202 INFO L225 Difference]: With dead ends: 90 [2021-12-21 18:15:34,202 INFO L226 Difference]: Without dead ends: 87 [2021-12-21 18:15:34,204 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-21 18:15:34,206 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 18:15:34,207 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-21 18:15:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-21 18:15:34,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-21 18:15:34,238 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-21 18:15:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-21 18:15:34,241 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2021-12-21 18:15:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:34,241 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-21 18:15:34,242 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-21 18:15:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-21 18:15:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-21 18:15:34,242 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:34,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-21 18:15:34,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 18:15:34,243 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-21 18:15:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2021-12-21 18:15:34,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:34,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348359464] [2021-12-21 18:15:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:34,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:15:34,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:34,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348359464] [2021-12-21 18:15:34,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348359464] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:34,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:34,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:15:34,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058958888] [2021-12-21 18:15:34,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:34,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:15:34,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:34,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:15:34,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:15:34,299 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-21 18:15:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:34,345 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-12-21 18:15:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:15:34,346 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-21 18:15:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:34,346 INFO L225 Difference]: With dead ends: 84 [2021-12-21 18:15:34,347 INFO L226 Difference]: Without dead ends: 84 [2021-12-21 18:15:34,347 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-21 18:15:34,348 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-21 18:15:34,348 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-21 18:15:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-21 18:15:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-21 18:15:34,352 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-21 18:15:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-21 18:15:34,353 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2021-12-21 18:15:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:34,354 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-21 18:15:34,354 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-21 18:15:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-21 18:15:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 18:15:34,355 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:34,355 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:34,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 18:15:34,355 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-21 18:15:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2021-12-21 18:15:34,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:34,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282426772] [2021-12-21 18:15:34,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:34,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:15:34,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:34,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282426772] [2021-12-21 18:15:34,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282426772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:34,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:34,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:15:34,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945636057] [2021-12-21 18:15:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:34,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:15:34,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:15:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:15:34,428 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-21 18:15:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:34,477 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-21 18:15:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:15:34,478 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-21 18:15:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:34,479 INFO L225 Difference]: With dead ends: 95 [2021-12-21 18:15:34,479 INFO L226 Difference]: Without dead ends: 95 [2021-12-21 18:15:34,479 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-21 18:15:34,480 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.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:34,480 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.0s Time] [2021-12-21 18:15:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-21 18:15:34,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-21 18:15:34,485 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-21 18:15:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-12-21 18:15:34,486 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2021-12-21 18:15:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:34,487 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-12-21 18:15:34,487 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-21 18:15:34,487 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-12-21 18:15:34,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 18:15:34,487 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:34,488 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:34,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 18:15:34,488 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-21 18:15:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:34,488 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2021-12-21 18:15:34,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:34,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332913131] [2021-12-21 18:15:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:34,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,586 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-21 18:15:34,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:34,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332913131] [2021-12-21 18:15:34,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332913131] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:34,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:34,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:15:34,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026471511] [2021-12-21 18:15:34,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:34,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:15:34,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:34,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:15:34,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:15:34,589 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-21 18:15:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:34,720 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-21 18:15:34,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:15:34,723 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-21 18:15:34,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:34,725 INFO L225 Difference]: With dead ends: 105 [2021-12-21 18:15:34,725 INFO L226 Difference]: Without dead ends: 105 [2021-12-21 18:15:34,725 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-21 18:15:34,726 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:34,727 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.1s Time] [2021-12-21 18:15:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-21 18:15:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-12-21 18:15:34,730 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-21 18:15:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-21 18:15:34,731 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2021-12-21 18:15:34,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:34,731 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-21 18:15:34,731 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-21 18:15:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-21 18:15:34,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 18:15:34,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:34,732 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:15:34,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 18:15:34,733 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-21 18:15:34,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:34,733 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2021-12-21 18:15:34,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:34,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876177952] [2021-12-21 18:15:34,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:34,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:34,838 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-21 18:15:34,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:34,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876177952] [2021-12-21 18:15:34,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876177952] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:34,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:34,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:15:34,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485303999] [2021-12-21 18:15:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:34,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:15:34,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:34,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:15:34,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:15:34,840 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-21 18:15:34,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:34,961 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-21 18:15:34,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:15:34,962 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-21 18:15:34,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:34,963 INFO L225 Difference]: With dead ends: 84 [2021-12-21 18:15:34,963 INFO L226 Difference]: Without dead ends: 84 [2021-12-21 18:15:34,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-21 18:15:34,964 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-21 18:15:34,966 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-21 18:15:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-21 18:15:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-21 18:15:34,969 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-21 18:15:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-21 18:15:34,970 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2021-12-21 18:15:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:34,970 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-21 18:15:34,970 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-21 18:15:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-21 18:15:34,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 18:15:34,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:34,971 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-21 18:15:34,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 18:15:34,972 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-21 18:15:34,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2021-12-21 18:15:34,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:34,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849709508] [2021-12-21 18:15:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:34,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:35,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:35,084 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-21 18:15:35,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:35,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849709508] [2021-12-21 18:15:35,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849709508] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:35,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227512793] [2021-12-21 18:15:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:35,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:35,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:35,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:15:35,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 18:15:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:35,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 18:15:35,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:35,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:35,482 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:15:35,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-21 18:15:35,501 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-21 18:15:35,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:35,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227512793] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:35,582 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:15:35,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-21 18:15:35,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101054419] [2021-12-21 18:15:35,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:35,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:15:35,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:15:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:15:35,584 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-21 18:15:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:35,798 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2021-12-21 18:15:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:15:35,799 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-21 18:15:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:35,800 INFO L225 Difference]: With dead ends: 110 [2021-12-21 18:15:35,800 INFO L226 Difference]: Without dead ends: 110 [2021-12-21 18:15:35,800 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-21 18:15:35,801 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-21 18:15:35,801 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-21 18:15:35,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-21 18:15:35,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2021-12-21 18:15:35,805 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-21 18:15:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-21 18:15:35,805 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2021-12-21 18:15:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:35,806 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-21 18:15:35,806 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-21 18:15:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-21 18:15:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 18:15:35,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:35,807 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-21 18:15:35,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:36,022 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-21 18:15:36,022 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-21 18:15:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2021-12-21 18:15:36,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:36,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031379481] [2021-12-21 18:15:36,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:36,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:36,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:36,265 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-21 18:15:36,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:36,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031379481] [2021-12-21 18:15:36,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031379481] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:36,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471674331] [2021-12-21 18:15:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:36,267 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:36,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:36,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:15:36,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 18:15:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:36,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-21 18:15:36,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:36,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:36,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:15:36,676 INFO L387 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-21 18:15:36,684 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:15:36,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:15:36,713 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-21 18:15:36,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:36,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471674331] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:36,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:15:36,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-12-21 18:15:36,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154651542] [2021-12-21 18:15:36,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:36,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-21 18:15:36,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-21 18:15:36,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-21 18:15:36,829 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-21 18:15:37,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:37,121 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2021-12-21 18:15:37,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:15:37,122 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-21 18:15:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:37,124 INFO L225 Difference]: With dead ends: 90 [2021-12-21 18:15:37,124 INFO L226 Difference]: Without dead ends: 90 [2021-12-21 18:15:37,124 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-21 18:15:37,125 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.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:37,125 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.2s Time] [2021-12-21 18:15:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-21 18:15:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2021-12-21 18:15:37,149 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-21 18:15:37,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-21 18:15:37,149 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2021-12-21 18:15:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:37,149 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-21 18:15:37,149 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-21 18:15:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-21 18:15:37,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:15:37,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:37,150 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-21 18:15:37,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-21 18:15:37,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-12-21 18:15:37,363 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-21 18:15:37,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2021-12-21 18:15:37,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:37,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448986175] [2021-12-21 18:15:37,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:37,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:37,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:37,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:37,429 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-21 18:15:37,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:37,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448986175] [2021-12-21 18:15:37,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448986175] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:37,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481603870] [2021-12-21 18:15:37,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:37,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:37,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:37,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:15:37,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 18:15:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:37,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:15:37,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:37,575 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-21 18:15:37,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:37,636 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-21 18:15:37,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481603870] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:15:37,637 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:15:37,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-21 18:15:37,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184582158] [2021-12-21 18:15:37,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:37,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:15:37,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:37,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:15:37,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:15:37,638 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-21 18:15:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:37,701 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-21 18:15:37,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:15:37,702 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-21 18:15:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:37,703 INFO L225 Difference]: With dead ends: 89 [2021-12-21 18:15:37,703 INFO L226 Difference]: Without dead ends: 89 [2021-12-21 18:15:37,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:15:37,705 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-21 18:15:37,705 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-21 18:15:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-21 18:15:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-12-21 18:15:37,716 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-21 18:15:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-21 18:15:37,718 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2021-12-21 18:15:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:37,718 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-21 18:15:37,718 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-21 18:15:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-21 18:15:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:15:37,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:37,721 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-21 18:15:37,741 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-21 18:15:37,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:37,938 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-21 18:15:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2021-12-21 18:15:37,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:37,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786232607] [2021-12-21 18:15:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:37,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:37,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:38,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:38,012 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-21 18:15:38,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:38,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786232607] [2021-12-21 18:15:38,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786232607] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:38,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940660302] [2021-12-21 18:15:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:38,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:38,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:38,028 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:15:38,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 18:15:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:38,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:15:38,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:38,186 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-21 18:15:38,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:38,198 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:15:38,199 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2021-12-21 18:15:38,231 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-21 18:15:38,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940660302] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:15:38,231 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:15:38,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2021-12-21 18:15:38,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75973211] [2021-12-21 18:15:38,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:38,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:15:38,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:38,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:15:38,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:15:38,233 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-21 18:15:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:38,315 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2021-12-21 18:15:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:15:38,316 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-21 18:15:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:38,316 INFO L225 Difference]: With dead ends: 113 [2021-12-21 18:15:38,316 INFO L226 Difference]: Without dead ends: 113 [2021-12-21 18:15:38,317 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-21 18:15:38,317 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-21 18:15:38,317 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-21 18:15:38,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-21 18:15:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2021-12-21 18:15:38,319 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-21 18:15:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2021-12-21 18:15:38,320 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2021-12-21 18:15:38,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:38,320 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2021-12-21 18:15:38,321 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-21 18:15:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2021-12-21 18:15:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:15:38,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:38,321 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-21 18:15:38,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:38,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:38,548 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-21 18:15:38,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2021-12-21 18:15:38,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:38,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471960338] [2021-12-21 18:15:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:38,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:38,650 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-21 18:15:38,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471960338] [2021-12-21 18:15:38,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471960338] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798046948] [2021-12-21 18:15:38,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:38,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:38,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:38,668 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:15:38,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 18:15:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:38,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-21 18:15:38,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:38,897 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-21 18:15:38,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:38,925 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:15:38,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2021-12-21 18:15:39,054 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-21 18:15:39,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798046948] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:15:39,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:15:39,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2021-12-21 18:15:39,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80687960] [2021-12-21 18:15:39,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:39,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-21 18:15:39,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-21 18:15:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-12-21 18:15:39,056 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-21 18:15:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:39,285 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-21 18:15:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:15:39,285 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-21 18:15:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:39,286 INFO L225 Difference]: With dead ends: 150 [2021-12-21 18:15:39,286 INFO L226 Difference]: Without dead ends: 150 [2021-12-21 18:15:39,286 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-21 18:15:39,287 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:39,287 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.2s Time] [2021-12-21 18:15:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-21 18:15:39,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2021-12-21 18:15:39,289 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-21 18:15:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2021-12-21 18:15:39,289 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2021-12-21 18:15:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:39,289 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2021-12-21 18:15:39,289 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-21 18:15:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2021-12-21 18:15:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:15:39,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:39,290 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-21 18:15:39,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:39,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-21 18:15:39,490 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-21 18:15:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2021-12-21 18:15:39,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:39,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634438913] [2021-12-21 18:15:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:39,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:39,588 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-21 18:15:39,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:39,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634438913] [2021-12-21 18:15:39,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634438913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:39,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:39,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:15:39,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182606979] [2021-12-21 18:15:39,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:39,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:15:39,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:39,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:15:39,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:15:39,589 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-21 18:15:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:39,690 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-12-21 18:15:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:15:39,690 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-21 18:15:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:39,691 INFO L225 Difference]: With dead ends: 111 [2021-12-21 18:15:39,691 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 18:15:39,691 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-21 18:15:39,691 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-21 18:15:39,691 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-21 18:15:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 18:15:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2021-12-21 18:15:39,693 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-21 18:15:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2021-12-21 18:15:39,693 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2021-12-21 18:15:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:39,694 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2021-12-21 18:15:39,694 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-21 18:15:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2021-12-21 18:15:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:15:39,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:39,694 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-21 18:15:39,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 18:15:39,694 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-21 18:15:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2021-12-21 18:15:39,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:39,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282717383] [2021-12-21 18:15:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:39,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:39,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:39,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:39,795 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-21 18:15:39,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:39,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282717383] [2021-12-21 18:15:39,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282717383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:39,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:39,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 18:15:39,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361870294] [2021-12-21 18:15:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:39,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:15:39,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:15:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:15:39,796 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-21 18:15:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:39,914 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2021-12-21 18:15:39,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:15:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-21 18:15:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:39,915 INFO L225 Difference]: With dead ends: 89 [2021-12-21 18:15:39,915 INFO L226 Difference]: Without dead ends: 89 [2021-12-21 18:15:39,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-21 18:15:39,915 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 136 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:39,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 290 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:15:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-21 18:15:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-21 18:15:39,917 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-21 18:15:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2021-12-21 18:15:39,918 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2021-12-21 18:15:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:39,918 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2021-12-21 18:15:39,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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-21 18:15:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2021-12-21 18:15:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 18:15:39,918 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:39,918 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-21 18:15:39,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 18:15:39,918 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-21 18:15:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:39,919 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2021-12-21 18:15:39,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:39,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683275762] [2021-12-21 18:15:39,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:39,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,026 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-21 18:15:40,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:40,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683275762] [2021-12-21 18:15:40,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683275762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:40,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:40,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:15:40,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928487044] [2021-12-21 18:15:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:40,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:15:40,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:15:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:15:40,027 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-21 18:15:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:40,295 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-12-21 18:15:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:15:40,295 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-21 18:15:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:40,296 INFO L225 Difference]: With dead ends: 158 [2021-12-21 18:15:40,296 INFO L226 Difference]: Without dead ends: 158 [2021-12-21 18:15:40,296 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-21 18:15:40,297 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-21 18:15:40,297 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-21 18:15:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-21 18:15:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2021-12-21 18:15:40,298 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-21 18:15:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-21 18:15:40,299 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2021-12-21 18:15:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:40,299 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-21 18:15:40,299 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-21 18:15:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-21 18:15:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 18:15:40,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:40,300 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-21 18:15:40,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 18:15:40,300 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-21 18:15:40,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2021-12-21 18:15:40,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:40,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82212826] [2021-12-21 18:15:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:40,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,425 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-21 18:15:40,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:40,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82212826] [2021-12-21 18:15:40,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82212826] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:40,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:40,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:15:40,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505616999] [2021-12-21 18:15:40,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:40,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:15:40,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:40,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:15:40,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:15:40,426 INFO L87 Difference]: Start difference. First operand 92 states and 105 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-21 18:15:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:40,689 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2021-12-21 18:15:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:15:40,690 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-21 18:15:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:40,690 INFO L225 Difference]: With dead ends: 138 [2021-12-21 18:15:40,690 INFO L226 Difference]: Without dead ends: 138 [2021-12-21 18:15:40,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-12-21 18:15:40,691 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 331 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:40,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 515 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:15:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-21 18:15:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2021-12-21 18:15:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.515625) internal successors, (97), 87 states have internal predecessors, (97), 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-21 18:15:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-12-21 18:15:40,693 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 35 [2021-12-21 18:15:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:40,693 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-12-21 18:15:40,693 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-21 18:15:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-12-21 18:15:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 18:15:40,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:40,694 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] [2021-12-21 18:15:40,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 18:15:40,694 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:15:40,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:40,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1296521997, now seen corresponding path program 1 times [2021-12-21 18:15:40,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:40,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708150394] [2021-12-21 18:15:40,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:40,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,742 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-21 18:15:40,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:40,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708150394] [2021-12-21 18:15:40,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708150394] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:40,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:40,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:15:40,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911156622] [2021-12-21 18:15:40,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:40,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:15:40,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:40,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:15:40,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:15:40,743 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-21 18:15:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:40,795 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2021-12-21 18:15:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:15:40,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 37 [2021-12-21 18:15:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:40,796 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:15:40,796 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:15:40,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:15:40,796 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 89 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:40,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 209 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:15:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:15:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2021-12-21 18:15:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.5) internal successors, (99), 89 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-21 18:15:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2021-12-21 18:15:40,798 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 37 [2021-12-21 18:15:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:40,798 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2021-12-21 18:15:40,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-21 18:15:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2021-12-21 18:15:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 18:15:40,799 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:40,799 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-21 18:15:40,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-21 18:15:40,799 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-21 18:15:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2021-12-21 18:15:40,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:40,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16617048] [2021-12-21 18:15:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:40,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:15:40,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:40,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16617048] [2021-12-21 18:15:40,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16617048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:40,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:40,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:15:40,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559103821] [2021-12-21 18:15:40,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:40,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:15:40,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:40,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:15:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:15:40,841 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:15:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:40,906 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2021-12-21 18:15:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:15:40,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2021-12-21 18:15:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:40,907 INFO L225 Difference]: With dead ends: 170 [2021-12-21 18:15:40,907 INFO L226 Difference]: Without dead ends: 170 [2021-12-21 18:15:40,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-21 18:15:40,907 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 98 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:40,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 287 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:15:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-21 18:15:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 95. [2021-12-21 18:15:40,909 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-21 18:15:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2021-12-21 18:15:40,909 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 38 [2021-12-21 18:15:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:40,909 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2021-12-21 18:15:40,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:15:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2021-12-21 18:15:40,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 18:15:40,910 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:40,910 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-21 18:15:40,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 18:15:40,910 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:15:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2021-12-21 18:15:40,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:40,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100274418] [2021-12-21 18:15:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:40,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-21 18:15:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:40,977 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-21 18:15:40,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:40,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100274418] [2021-12-21 18:15:40,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100274418] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:40,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427934056] [2021-12-21 18:15:40,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:40,978 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:40,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:40,978 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:15:40,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 18:15:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:41,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:15:41,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:41,205 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-21 18:15:41,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:15:41,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427934056] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:41,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:15:41,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-21 18:15:41,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836217654] [2021-12-21 18:15:41,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:41,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:15:41,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:41,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:15:41,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:15:41,206 INFO L87 Difference]: Start difference. First operand 95 states and 106 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-21 18:15:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:41,213 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-12-21 18:15:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:15:41,213 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-21 18:15:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:41,214 INFO L225 Difference]: With dead ends: 83 [2021-12-21 18:15:41,214 INFO L226 Difference]: Without dead ends: 83 [2021-12-21 18:15:41,214 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-21 18:15:41,214 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 63 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 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-21 18:15:41,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:15:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-21 18:15:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-12-21 18:15:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 79 states have internal predecessors, (86), 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-21 18:15:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-12-21 18:15:41,216 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 41 [2021-12-21 18:15:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:41,216 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-12-21 18:15:41,216 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-21 18:15:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-12-21 18:15:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 18:15:41,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:41,217 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] [2021-12-21 18:15:41,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 18:15:41,434 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,SelfDestructingSolverStorable16 [2021-12-21 18:15:41,434 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:15:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116999, now seen corresponding path program 1 times [2021-12-21 18:15:41,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:41,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001304266] [2021-12-21 18:15:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:41,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:41,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:41,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 18:15:41,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:41,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001304266] [2021-12-21 18:15:41,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001304266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:15:41,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:15:41,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:15:41,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489726854] [2021-12-21 18:15:41,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:15:41,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:15:41,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:41,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:15:41,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:15:41,566 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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-21 18:15:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:41,777 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2021-12-21 18:15:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:15:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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 42 [2021-12-21 18:15:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:41,778 INFO L225 Difference]: With dead ends: 108 [2021-12-21 18:15:41,778 INFO L226 Difference]: Without dead ends: 108 [2021-12-21 18:15:41,778 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-21 18:15:41,778 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 289 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:41,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 317 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:15:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-21 18:15:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2021-12-21 18:15:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 82 states have internal predecessors, (92), 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-21 18:15:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2021-12-21 18:15:41,780 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 42 [2021-12-21 18:15:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:41,781 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2021-12-21 18:15:41,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 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-21 18:15:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2021-12-21 18:15:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 18:15:41,781 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:41,781 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] [2021-12-21 18:15:41,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 18:15:41,781 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:15:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116998, now seen corresponding path program 1 times [2021-12-21 18:15:41,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:41,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158771816] [2021-12-21 18:15:41,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:41,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:15:41,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:41,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158771816] [2021-12-21 18:15:41,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158771816] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:41,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683021112] [2021-12-21 18:15:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:41,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:41,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:41,856 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:15:41,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 18:15:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:42,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:15:42,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:15:42,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:15:42,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683021112] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:15:42,171 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:15:42,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-21 18:15:42,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567048787] [2021-12-21 18:15:42,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:42,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:15:42,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:42,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:15:42,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:15:42,173 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 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-21 18:15:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:42,232 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2021-12-21 18:15:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:15:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 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 42 [2021-12-21 18:15:42,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:42,233 INFO L225 Difference]: With dead ends: 108 [2021-12-21 18:15:42,233 INFO L226 Difference]: Without dead ends: 108 [2021-12-21 18:15:42,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:15:42,233 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 194 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:42,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 254 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:15:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-21 18:15:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-12-21 18:15:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.481012658227848) internal successors, (117), 98 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-21 18:15:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2021-12-21 18:15:42,250 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 42 [2021-12-21 18:15:42,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:42,250 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2021-12-21 18:15:42,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 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-21 18:15:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2021-12-21 18:15:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-21 18:15:42,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:42,251 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-21 18:15:42,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-21 18:15:42,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:42,480 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:15:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash -960994977, now seen corresponding path program 1 times [2021-12-21 18:15:42,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:42,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702126852] [2021-12-21 18:15:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:42,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:42,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702126852] [2021-12-21 18:15:42,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702126852] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:42,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127781673] [2021-12-21 18:15:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:42,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:42,906 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:15:42,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 18:15:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:43,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-21 18:15:43,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:43,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:43,244 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:15:43,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:15:43,275 INFO L387 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-21 18:15:43,328 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:15:43,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-21 18:15:43,367 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:15:43,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:15:43,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:15:43,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:15:43,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:15:43,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:15:43,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 18:15:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:43,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:48,239 INFO L353 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-21 18:15:48,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-21 18:15:48,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-21 18:15:48,250 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |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-21 18:15:48,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2201 (Array Int Int)) (v_ArrVal_2200 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2200) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) is different from false [2021-12-21 18:15:48,263 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:15:48,263 INFO L387 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-21 18:15:48,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-21 18:15:48,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-21 18:15:48,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2021-12-21 18:15:48,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127781673] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:48,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:15:48,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 29 [2021-12-21 18:15:48,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726650172] [2021-12-21 18:15:48,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:15:48,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-21 18:15:48,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:15:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-21 18:15:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1164, Unknown=5, NotChecked=210, Total=1482 [2021-12-21 18:15:48,450 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 30 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (4), 3 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-21 18:15:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:15:49,472 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2021-12-21 18:15:49,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:15:49,473 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (4), 3 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 43 [2021-12-21 18:15:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:15:49,474 INFO L225 Difference]: With dead ends: 220 [2021-12-21 18:15:49,474 INFO L226 Difference]: Without dead ends: 220 [2021-12-21 18:15:49,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=262, Invalid=1907, Unknown=5, NotChecked=276, Total=2450 [2021-12-21 18:15:49,477 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 631 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 18:15:49,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 1155 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 18:15:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-21 18:15:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2021-12-21 18:15:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4831460674157304) internal successors, (132), 108 states have internal predecessors, (132), 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-21 18:15:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2021-12-21 18:15:49,484 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 43 [2021-12-21 18:15:49,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:15:49,484 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2021-12-21 18:15:49,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 26 states have internal predecessors, (58), 2 states have call successors, (4), 3 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-21 18:15:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2021-12-21 18:15:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-21 18:15:49,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:15:49,484 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-21 18:15:49,515 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-21 18:15:49,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:49,705 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:15:49,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:15:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -960994976, now seen corresponding path program 1 times [2021-12-21 18:15:49,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:15:49,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547521303] [2021-12-21 18:15:49,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:49,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:15:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:15:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:50,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:15:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:50,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:15:50,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547521303] [2021-12-21 18:15:50,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547521303] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:15:50,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904829355] [2021-12-21 18:15:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:15:50,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:15:50,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:15:50,335 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-21 18:15:50,336 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-21 18:15:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:15:50,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-21 18:15:50,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:15:50,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:15:50,855 INFO L353 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2021-12-21 18:15:50,855 INFO L387 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-21 18:15:50,877 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:15:50,877 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:15:50,982 INFO L387 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-21 18:15:50,993 INFO L387 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-21 18:15:51,059 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:15:51,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2021-12-21 18:15:51,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 18:15:51,187 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:15:51,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-21 18:15:51,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 18:15:51,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:15:51,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:15:51,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:15:51,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:15:51,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:15:51,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:15:51,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:15:51,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:15:51,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 18:15:51,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:15:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:15:51,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:15:53,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2400 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2400) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_2400 Int)) (<= 0 (+ 8 (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_14| 8) v_ArrVal_2400) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2021-12-21 18:15:55,885 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2400 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (forall ((v_ArrVal_2400 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-12-21 18:15:57,915 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2401 Int) (v_ArrVal_2400 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ 12 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2400 Int)) (<= 0 (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2021-12-21 18:15:59,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2397 Int) (v_ArrVal_2399 Int) (v_ArrVal_2401 Int) (v_ArrVal_2400 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8))) (<= (+ (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2399) .cse1 v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2397) .cse1 v_ArrVal_2401) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2399 Int) (v_ArrVal_2400 Int)) (<= 0 (+ (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2399) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2400) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8)))))) is different from false [2021-12-21 18:16:00,352 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:00,352 INFO L387 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 97 treesize of output 90 [2021-12-21 18:16:00,358 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:00,359 INFO L387 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 90 treesize of output 90 [2021-12-21 18:16:00,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 423 [2021-12-21 18:16:00,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1434 treesize of output 1414 [2021-12-21 18:16:00,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1324 treesize of output 1304 [2021-12-21 18:16:00,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1224 treesize of output 1206 [2021-12-21 18:16:00,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1037 treesize of output 1005 [2021-12-21 18:16:00,397 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 925 treesize of output 909 [2021-12-21 18:16:00,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 749 treesize of output 717 [2021-12-21 18:16:00,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,410 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 637 treesize of output 621 [2021-12-21 18:16:00,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 601 treesize of output 597 [2021-12-21 18:16:00,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:00,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 585 [2021-12-21 18:16:01,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904829355] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:01,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:01,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 38 [2021-12-21 18:16:01,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423880005] [2021-12-21 18:16:01,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:01,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-21 18:16:01,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-21 18:16:01,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2299, Unknown=6, NotChecked=396, Total=2862 [2021-12-21 18:16:01,426 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:16:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:02,938 INFO L93 Difference]: Finished difference Result 256 states and 314 transitions. [2021-12-21 18:16:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 18:16:02,939 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2021-12-21 18:16:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:02,940 INFO L225 Difference]: With dead ends: 256 [2021-12-21 18:16:02,940 INFO L226 Difference]: Without dead ends: 256 [2021-12-21 18:16:02,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=384, Invalid=3408, Unknown=6, NotChecked=492, Total=4290 [2021-12-21 18:16:02,941 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 916 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:02,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 1186 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 18:16:02,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-21 18:16:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 120. [2021-12-21 18:16:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.4742268041237114) internal successors, (143), 116 states have internal predecessors, (143), 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-21 18:16:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2021-12-21 18:16:02,944 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 43 [2021-12-21 18:16:02,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:02,944 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2021-12-21 18:16:02,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 34 states have internal predecessors, (69), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:16:02,944 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2021-12-21 18:16:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-21 18:16:02,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:02,944 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-21 18:16:02,987 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-21 18:16:03,167 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-21 18:16:03,167 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-21 18:16:03,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1252304435, now seen corresponding path program 2 times [2021-12-21 18:16:03,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:03,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123761244] [2021-12-21 18:16:03,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:03,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:03,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:03,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:03,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123761244] [2021-12-21 18:16:03,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123761244] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:03,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644590726] [2021-12-21 18:16:03,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:16:03,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:03,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:03,279 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-21 18:16:03,282 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-21 18:16:03,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 18:16:03,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:16:03,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:16:03,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:03,614 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-21 18:16:03,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:03,682 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-21 18:16:03,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644590726] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:03,683 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:16:03,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-21 18:16:03,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100329568] [2021-12-21 18:16:03,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:03,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:16:03,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:16:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:16:03,684 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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-21 18:16:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:03,751 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2021-12-21 18:16:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:16:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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-21 18:16:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:03,752 INFO L225 Difference]: With dead ends: 112 [2021-12-21 18:16:03,752 INFO L226 Difference]: Without dead ends: 112 [2021-12-21 18:16:03,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:16:03,753 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 254 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:03,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 210 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-21 18:16:03,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2021-12-21 18:16:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 102 states have internal predecessors, (122), 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-21 18:16:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2021-12-21 18:16:03,759 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 46 [2021-12-21 18:16:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:03,759 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2021-12-21 18:16:03,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 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-21 18:16:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2021-12-21 18:16:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-21 18:16:03,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:03,760 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] [2021-12-21 18:16:03,778 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-21 18:16:03,978 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-21 18:16:03,978 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-21 18:16:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:03,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676750, now seen corresponding path program 2 times [2021-12-21 18:16:03,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:03,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556620359] [2021-12-21 18:16:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:03,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:04,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:04,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556620359] [2021-12-21 18:16:04,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556620359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:04,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810479690] [2021-12-21 18:16:04,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:16:04,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:04,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:04,081 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-21 18:16:04,082 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-21 18:16:04,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 18:16:04,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:16:04,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-21 18:16:04,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 18:16:04,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:04,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810479690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:04,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:16:04,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2021-12-21 18:16:04,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131201793] [2021-12-21 18:16:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:04,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:16:04,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:04,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:16:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:16:04,414 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-21 18:16:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:04,589 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2021-12-21 18:16:04,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:16:04,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 47 [2021-12-21 18:16:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:04,590 INFO L225 Difference]: With dead ends: 147 [2021-12-21 18:16:04,590 INFO L226 Difference]: Without dead ends: 147 [2021-12-21 18:16:04,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-12-21 18:16:04,590 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 426 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:04,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 276 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-21 18:16:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2021-12-21 18:16:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 102 states have internal predecessors, (120), 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-21 18:16:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2021-12-21 18:16:04,593 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 47 [2021-12-21 18:16:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:04,593 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2021-12-21 18:16:04,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-21 18:16:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2021-12-21 18:16:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-21 18:16:04,594 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:04,594 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] [2021-12-21 18:16:04,611 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-21 18:16:04,811 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,SelfDestructingSolverStorable22 [2021-12-21 18:16:04,811 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-21 18:16:04,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:04,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676805, now seen corresponding path program 1 times [2021-12-21 18:16:04,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:04,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721046275] [2021-12-21 18:16:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:04,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:04,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 18:16:04,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:04,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721046275] [2021-12-21 18:16:04,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721046275] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:04,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:04,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:16:04,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431644011] [2021-12-21 18:16:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:04,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:16:04,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:16:04,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:16:04,880 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-21 18:16:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:04,930 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-21 18:16:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:16:04,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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 47 [2021-12-21 18:16:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:04,933 INFO L225 Difference]: With dead ends: 103 [2021-12-21 18:16:04,933 INFO L226 Difference]: Without dead ends: 103 [2021-12-21 18:16:04,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-21 18:16:04,934 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 19 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:04,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 262 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-21 18:16:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-12-21 18:16:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 97 states have internal predecessors, (108), 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-21 18:16:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-12-21 18:16:04,938 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 47 [2021-12-21 18:16:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:04,938 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-12-21 18:16:04,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 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-21 18:16:04,938 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-12-21 18:16:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 18:16:04,938 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:04,938 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] [2021-12-21 18:16:04,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-21 18:16:04,939 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:04,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:04,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1716069023, now seen corresponding path program 1 times [2021-12-21 18:16:04,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:04,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733057465] [2021-12-21 18:16:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:04,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:04,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:05,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:05,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733057465] [2021-12-21 18:16:05,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733057465] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:05,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592926235] [2021-12-21 18:16:05,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:05,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:05,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:05,002 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-21 18:16:05,004 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-21 18:16:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:05,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:16:05,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:05,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:05,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592926235] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:05,336 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:16:05,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2021-12-21 18:16:05,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697104024] [2021-12-21 18:16:05,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:05,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:16:05,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:16:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:16:05,337 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:16:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:05,389 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-12-21 18:16:05,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:16:05,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2021-12-21 18:16:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:05,390 INFO L225 Difference]: With dead ends: 99 [2021-12-21 18:16:05,390 INFO L226 Difference]: Without dead ends: 99 [2021-12-21 18:16:05,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:16:05,391 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 61 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:05,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 373 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-21 18:16:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-21 18:16:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 93 states have internal predecessors, (101), 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-21 18:16:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-21 18:16:05,395 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2021-12-21 18:16:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:05,395 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-21 18:16:05,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:16:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-21 18:16:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-21 18:16:05,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:05,397 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-12-21 18:16:05,429 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-21 18:16:05,614 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,SelfDestructingSolverStorable24 [2021-12-21 18:16:05,614 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash -291844745, now seen corresponding path program 3 times [2021-12-21 18:16:05,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:05,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408257203] [2021-12-21 18:16:05,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:05,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:05,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 18:16:05,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:05,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408257203] [2021-12-21 18:16:05,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408257203] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:05,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218186675] [2021-12-21 18:16:05,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 18:16:05,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:05,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:05,740 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-21 18:16:05,741 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-21 18:16:06,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 18:16:06,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:16:06,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:16:06,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 18:16:06,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:06,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218186675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:06,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:16:06,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-12-21 18:16:06,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357105809] [2021-12-21 18:16:06,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:06,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:16:06,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:06,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:16:06,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:16:06,479 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) 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-21 18:16:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:06,497 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2021-12-21 18:16:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:16:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) 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 51 [2021-12-21 18:16:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:06,498 INFO L225 Difference]: With dead ends: 93 [2021-12-21 18:16:06,498 INFO L226 Difference]: Without dead ends: 93 [2021-12-21 18:16:06,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:16:06,499 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 137 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:06,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 145 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-21 18:16:06,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-21 18:16:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 87 states have internal predecessors, (93), 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-21 18:16:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-21 18:16:06,500 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 51 [2021-12-21 18:16:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:06,500 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-21 18:16:06,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) 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-21 18:16:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-21 18:16:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-21 18:16:06,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:06,501 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] [2021-12-21 18:16:06,519 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-21 18:16:06,701 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,SelfDestructingSolverStorable25 [2021-12-21 18:16:06,701 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:06,702 INFO L85 PathProgramCache]: Analyzing trace with hash 878531443, now seen corresponding path program 1 times [2021-12-21 18:16:06,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:06,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426597539] [2021-12-21 18:16:06,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:06,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:07,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:16:07,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:07,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426597539] [2021-12-21 18:16:07,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426597539] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:07,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59378614] [2021-12-21 18:16:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:07,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:07,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:07,294 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-21 18:16:07,295 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-21 18:16:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:07,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 105 conjunts are in the unsatisfiable core [2021-12-21 18:16:07,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:07,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:07,750 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:16:07,750 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:16:07,824 INFO L387 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-21 18:16:07,900 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:16:07,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-21 18:16:08,100 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:16:08,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-21 18:16:08,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:08,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:16:08,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:08,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:16:08,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 18:16:08,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-21 18:16:08,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 18:16:08,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-21 18:16:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:16:08,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:08,707 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3482 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) (forall ((v_ArrVal_3482 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-21 18:16:08,722 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3482 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3482 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-21 18:16:08,733 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3482 (Array Int Int))) (<= (select (select (store |c_#memory_int| (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_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_3482 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (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_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-21 18:16:08,743 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3482 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) (forall ((v_ArrVal_3482 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3482) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-21 18:16:08,757 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:08,767 INFO L387 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 36 treesize of output 37 [2021-12-21 18:16:08,774 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:08,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2021-12-21 18:16:08,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-21 18:16:08,808 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:08,808 INFO L387 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 36 treesize of output 37 [2021-12-21 18:16:08,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:08,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2021-12-21 18:16:08,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-21 18:16:09,054 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3481 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_3475) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-21 18:16:09,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3481 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_3475) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-21 18:16:09,067 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3474 (Array Int Int)) (v_ArrVal_3475 (Array Int Int)) (v_ArrVal_3481 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_3474) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3475) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_3481) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-21 18:16:09,075 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:09,075 INFO L387 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-21 18:16:09,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-21 18:16:09,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:09,079 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2021-12-21 18:16:09,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2021-12-21 18:16:09,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-21 18:16:09,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-21 18:16:09,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-21 18:16:09,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59378614] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:09,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:16:09,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 75 [2021-12-21 18:16:09,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737627713] [2021-12-21 18:16:09,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:09,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-12-21 18:16:09,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:09,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-12-21 18:16:09,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4316, Unknown=7, NotChecked=966, Total=5550 [2021-12-21 18:16:09,582 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-21 18:16:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:10,995 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-12-21 18:16:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 18:16:10,996 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2021-12-21 18:16:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:10,996 INFO L225 Difference]: With dead ends: 91 [2021-12-21 18:16:10,996 INFO L226 Difference]: Without dead ends: 91 [2021-12-21 18:16:10,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 88 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1799 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=508, Invalid=6319, Unknown=7, NotChecked=1176, Total=8010 [2021-12-21 18:16:10,998 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 263 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:10,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 1932 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1392 Invalid, 0 Unknown, 748 Unchecked, 0.6s Time] [2021-12-21 18:16:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-21 18:16:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-21 18:16:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 87 states have internal predecessors, (92), 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-21 18:16:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-12-21 18:16:11,000 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 54 [2021-12-21 18:16:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:11,000 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-12-21 18:16:11,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 66 states have internal predecessors, (132), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-21 18:16:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-12-21 18:16:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-21 18:16:11,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:11,000 INFO L514 BasicCegarLoop]: trace histogram [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, 1] [2021-12-21 18:16:11,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:11,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:11,201 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:11,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1199894254, now seen corresponding path program 1 times [2021-12-21 18:16:11,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:11,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225482348] [2021-12-21 18:16:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:11,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:11,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 18:16:11,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:11,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225482348] [2021-12-21 18:16:11,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225482348] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:11,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853456144] [2021-12-21 18:16:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:11,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:11,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:11,363 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:16:11,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 18:16:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:11,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 18:16:11,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 18:16:11,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-21 18:16:12,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853456144] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:12,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:16:12,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2021-12-21 18:16:12,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266701423] [2021-12-21 18:16:12,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:12,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-21 18:16:12,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-21 18:16:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2021-12-21 18:16:12,176 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 18:16:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:12,485 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-12-21 18:16:12,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 18:16:12,486 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2021-12-21 18:16:12,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:12,486 INFO L225 Difference]: With dead ends: 125 [2021-12-21 18:16:12,486 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 18:16:12,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2021-12-21 18:16:12,487 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 770 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:12,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 614 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 18:16:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2021-12-21 18:16:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 87 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-21 18:16:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-12-21 18:16:12,491 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 57 [2021-12-21 18:16:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:12,491 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-12-21 18:16:12,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 26 states have internal predecessors, (115), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-21 18:16:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-12-21 18:16:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 18:16:12,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:12,492 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-12-21 18:16:12,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-21 18:16:12,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-21 18:16:12,700 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:12,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:12,701 INFO L85 PathProgramCache]: Analyzing trace with hash 963119259, now seen corresponding path program 1 times [2021-12-21 18:16:12,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:12,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229548457] [2021-12-21 18:16:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:12,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:13,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:13,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:16:13,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:13,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229548457] [2021-12-21 18:16:13,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229548457] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:13,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962751756] [2021-12-21 18:16:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:13,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:13,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:13,131 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:16:13,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-21 18:16:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:13,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-21 18:16:13,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:13,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:13,537 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:16:13,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:16:13,571 INFO L387 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-21 18:16:13,609 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:16:13,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-21 18:16:13,635 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:16:13,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-21 18:16:13,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:13,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:16:13,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:13,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:16:13,926 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:16:13,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:16:14,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 18:16:14,057 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:16:14,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:14,094 INFO L353 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-21 18:16:14,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-21 18:16:14,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3877) |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.base|)) is different from false [2021-12-21 18:16:14,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-21 18:16:14,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 (Array Int Int))) (let ((.cse0 (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|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2021-12-21 18:16:14,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3877 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) is different from false [2021-12-21 18:16:14,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (let ((.cse1 (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|) (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3876)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2021-12-21 18:16:14,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-21 18:16:14,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) is different from false [2021-12-21 18:16:14,163 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) .cse1 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-21 18:16:14,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3873 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse1 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3873) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-21 18:16:14,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3873 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3872))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3873) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-21 18:16:14,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3873 Int) (v_ArrVal_3877 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3872))) (let ((.cse1 (store (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_3873) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2)))))) is different from false [2021-12-21 18:16:14,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3871 (Array Int Int)) (v_ArrVal_3872 (Array Int Int)) (v_ArrVal_3873 Int) (v_ArrVal_3877 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3871) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3872))) (let ((.cse1 (store (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_3873) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2)))))) is different from false [2021-12-21 18:16:14,233 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:14,234 INFO L387 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 109 treesize of output 86 [2021-12-21 18:16:14,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 490 treesize of output 476 [2021-12-21 18:16:14,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:14,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:14,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 246 [2021-12-21 18:16:14,256 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:14,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:14,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 202 [2021-12-21 18:16:14,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:14,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:16:14,265 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2021-12-21 18:16:14,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2021-12-21 18:16:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2021-12-21 18:16:14,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962751756] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:14,904 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:16:14,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 57 [2021-12-21 18:16:14,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261986727] [2021-12-21 18:16:14,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:14,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2021-12-21 18:16:14,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:14,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-12-21 18:16:14,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1954, Unknown=12, NotChecked=1188, Total=3306 [2021-12-21 18:16:14,906 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 58 states, 57 states have (on average 2.263157894736842) internal successors, (129), 51 states have internal predecessors, (129), 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-21 18:16:15,326 WARN L838 $PredicateComparison]: unable to prove that (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|)) (.cse3 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (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|)) (= .cse3 1) (not (= .cse3 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-21 18:16:15,330 WARN L838 $PredicateComparison]: unable to prove that (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|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_3877) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse1))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (= (select |c_#valid| .cse2) 1) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0))) is different from false [2021-12-21 18:16:15,331 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3876 Int) (v_ArrVal_3877 (Array Int Int))) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3876))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_3877) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)))) is different from false [2021-12-21 18:16:15,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:15,831 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2021-12-21 18:16:15,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 18:16:15,831 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.263157894736842) internal successors, (129), 51 states have internal predecessors, (129), 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 60 [2021-12-21 18:16:15,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:15,832 INFO L225 Difference]: With dead ends: 150 [2021-12-21 18:16:15,832 INFO L226 Difference]: Without dead ends: 150 [2021-12-21 18:16:15,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 86 SyntacticMatches, 10 SemanticMatches, 70 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=2976, Unknown=15, NotChecked=1860, Total=5112 [2021-12-21 18:16:15,833 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 291 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1845 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:15,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 1335 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1117 Invalid, 0 Unknown, 1845 Unchecked, 0.5s Time] [2021-12-21 18:16:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-21 18:16:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 95. [2021-12-21 18:16:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 91 states have internal predecessors, (98), 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-21 18:16:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-21 18:16:15,836 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 60 [2021-12-21 18:16:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:15,836 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-21 18:16:15,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.263157894736842) internal successors, (129), 51 states have internal predecessors, (129), 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-21 18:16:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-21 18:16:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-21 18:16:15,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:15,837 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1] [2021-12-21 18:16:15,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:16,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-21 18:16:16,044 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash 963119260, now seen corresponding path program 1 times [2021-12-21 18:16:16,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:16:16,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168369350] [2021-12-21 18:16:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:16,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:16:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 18:16:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:16,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-21 18:16:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:16,728 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 18:16:16,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:16:16,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168369350] [2021-12-21 18:16:16,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168369350] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:16,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091948252] [2021-12-21 18:16:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:16,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:16,744 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 18:16:16,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-21 18:16:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:17,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 112 conjunts are in the unsatisfiable core [2021-12-21 18:16:17,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:17,024 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:17,255 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:16:17,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:16:17,297 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: line 510245 column 46: unknown constant v_#length_BEFORE_CALL_6 [2021-12-21 18:16:17,297 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:16:17,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2021-12-21 18:16:17,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117760387] [2021-12-21 18:16:17,298 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:17,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-21 18:16:17,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:16:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-21 18:16:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2021-12-21 18:16:17,299 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 25 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:16:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 18:16:17,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2021-12-21 18:16:17,300 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:17,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:17,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-21 18:16:17,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:16:17,508 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@6da94fc5 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-21 18:16:17,512 INFO L158 Benchmark]: Toolchain (without parser) took 44570.81ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 118.6MB in the beginning and 218.2MB in the end (delta: -99.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2021-12-21 18:16:17,512 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 42.1MB in the beginning and 42.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:16:17,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.62ms. Allocated memory is still 146.8MB. Free memory was 118.6MB in the beginning and 116.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 18:16:17,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.09ms. Allocated memory is still 146.8MB. Free memory was 116.5MB in the beginning and 114.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:16:17,512 INFO L158 Benchmark]: Boogie Preprocessor took 22.71ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 112.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:16:17,513 INFO L158 Benchmark]: RCFGBuilder took 412.33ms. Allocated memory is still 146.8MB. Free memory was 112.4MB in the beginning and 94.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-21 18:16:17,517 INFO L158 Benchmark]: TraceAbstraction took 43715.02ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 93.6MB in the beginning and 218.2MB in the end (delta: -124.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:16:17,518 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 42.1MB in the beginning and 42.1MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.62ms. Allocated memory is still 146.8MB. Free memory was 118.6MB in the beginning and 116.5MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.09ms. Allocated memory is still 146.8MB. Free memory was 116.5MB in the beginning and 114.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.71ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 112.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 412.33ms. Allocated memory is still 146.8MB. Free memory was 112.4MB in the beginning and 94.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 43715.02ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 93.6MB in the beginning and 218.2MB in the end (delta: -124.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@6da94fc5 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@6da94fc5: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-21 18:16:17,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:16:19,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:16:19,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:16:19,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:16:19,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:16:19,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:16:19,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:16:19,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:16:19,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:16:19,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:16:19,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:16:19,321 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:16:19,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:16:19,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:16:19,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:16:19,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:16:19,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:16:19,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:16:19,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:16:19,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:16:19,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:16:19,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:16:19,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:16:19,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:16:19,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:16:19,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:16:19,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:16:19,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:16:19,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:16:19,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:16:19,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:16:19,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:16:19,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:16:19,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:16:19,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:16:19,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:16:19,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:16:19,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:16:19,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:16:19,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:16:19,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:16:19,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-21 18:16:19,383 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:16:19,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:16:19,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:16:19,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:16:19,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:16:19,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:16:19,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:16:19,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:16:19,386 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:16:19,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:16:19,387 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:16:19,388 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:16:19,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:16:19,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:16:19,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:16:19,388 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:16:19,388 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:16:19,388 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:16:19,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:16:19,389 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:16:19,389 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 18:16:19,389 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 18:16:19,389 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:16:19,389 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:16:19,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:16:19,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:16:19,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:16:19,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:16:19,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:16:19,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:16:19,390 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 18:16:19,390 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 18:16:19,391 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:16:19,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 18:16:19,391 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 6bfeee33a1b1d098a34bec7a761d4de16bc595043f21d77f5851cba758b79f34 [2021-12-21 18:16:19,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:16:19,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:16:19,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:16:19,738 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:16:19,739 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:16:19,740 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-21 18:16:19,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4373323dd/c832f801b8a044ee98b3432332517e7e/FLAGf27c046a7 [2021-12-21 18:16:20,231 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:16:20,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-21 18:16:20,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4373323dd/c832f801b8a044ee98b3432332517e7e/FLAGf27c046a7 [2021-12-21 18:16:20,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4373323dd/c832f801b8a044ee98b3432332517e7e [2021-12-21 18:16:20,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:16:20,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:16:20,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:16:20,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:16:20,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:16:20,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:16:20" (1/1) ... [2021-12-21 18:16:20,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9951bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:20, skipping insertion in model container [2021-12-21 18:16:20,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:16:20" (1/1) ... [2021-12-21 18:16:20,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:16:20,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:16:20,917 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.i[24538,24551] [2021-12-21 18:16:20,922 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:16:20,932 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:16:20,988 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.i[24538,24551] [2021-12-21 18:16:20,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:16:21,026 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:16:21,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21 WrapperNode [2021-12-21 18:16:21,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:16:21,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:16:21,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:16:21,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:16:21,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,093 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2021-12-21 18:16:21,093 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:16:21,094 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:16:21,094 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:16:21,094 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:16:21,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,111 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:16:21,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:16:21,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:16:21,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:16:21,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (1/1) ... [2021-12-21 18:16:21,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:16:21,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:16:21,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 18:16:21,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 18:16:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-21 18:16:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-21 18:16:21,225 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-21 18:16:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:16:21,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 18:16:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:16:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:16:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:16:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-21 18:16:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 18:16:21,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:16:21,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:16:21,366 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:16:21,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:16:21,727 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:16:21,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:16:21,732 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-21 18:16:21,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:16:21 BoogieIcfgContainer [2021-12-21 18:16:21,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:16:21,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:16:21,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:16:21,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:16:21,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:16:20" (1/3) ... [2021-12-21 18:16:21,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a473fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:16:21, skipping insertion in model container [2021-12-21 18:16:21,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:16:21" (2/3) ... [2021-12-21 18:16:21,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a473fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:16:21, skipping insertion in model container [2021-12-21 18:16:21,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:16:21" (3/3) ... [2021-12-21 18:16:21,739 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-12-21 18:16:21,743 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:16:21,744 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-21 18:16:21,772 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:16:21,777 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-21 18:16:21,777 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-21 18:16:21,795 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-21 18:16:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-21 18:16:21,800 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:21,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-21 18:16:21,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-21 18:16:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2021-12-21 18:16:21,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:21,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404290961] [2021-12-21 18:16:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:21,813 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:21,831 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:21,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-21 18:16:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:21,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:16:21,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:21,945 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:16:21,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:21,955 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:21,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404290961] [2021-12-21 18:16:21,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404290961] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:21,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:21,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:16:21,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944674231] [2021-12-21 18:16:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:21,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:16:21,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:21,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:16:21,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:21,980 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-21 18:16:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:22,084 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-21 18:16:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:16:22,086 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-21 18:16:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:22,091 INFO L225 Difference]: With dead ends: 90 [2021-12-21 18:16:22,091 INFO L226 Difference]: Without dead ends: 87 [2021-12-21 18:16:22,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:22,094 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-21 18:16:22,095 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-21 18:16:22,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-21 18:16:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-21 18:16:22,128 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-21 18:16:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-21 18:16:22,130 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2021-12-21 18:16:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:22,130 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-21 18:16:22,130 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-21 18:16:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-21 18:16:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-21 18:16:22,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:22,131 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-21 18:16:22,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:22,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:22,336 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-21 18:16:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2021-12-21 18:16:22,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:22,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97652837] [2021-12-21 18:16:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:22,337 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:22,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:22,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-21 18:16:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:22,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:16:22,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:22,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:16:22,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:22,454 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:22,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97652837] [2021-12-21 18:16:22,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97652837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:22,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:22,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:16:22,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280974834] [2021-12-21 18:16:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:22,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:16:22,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:16:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:22,463 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-21 18:16:22,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:22,543 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-12-21 18:16:22,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:16:22,544 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-21 18:16:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:22,545 INFO L225 Difference]: With dead ends: 84 [2021-12-21 18:16:22,545 INFO L226 Difference]: Without dead ends: 84 [2021-12-21 18:16:22,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:22,546 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:22,546 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.1s Time] [2021-12-21 18:16:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-21 18:16:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-21 18:16:22,550 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-21 18:16:22,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-21 18:16:22,551 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2021-12-21 18:16:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:22,551 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-21 18:16:22,552 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-21 18:16:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-21 18:16:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 18:16:22,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:22,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:22,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:22,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:22,759 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-21 18:16:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2021-12-21 18:16:22,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:22,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981765426] [2021-12-21 18:16:22,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:22,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:22,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:22,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:22,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-21 18:16:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:22,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:16:22,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:16:22,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:22,884 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:22,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981765426] [2021-12-21 18:16:22,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981765426] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:22,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:22,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:16:22,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801608566] [2021-12-21 18:16:22,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:22,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:16:22,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:16:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:22,890 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 3 states, 3 states have (on average 4.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-21 18:16:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:22,907 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-21 18:16:22,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:16:22,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.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-21 18:16:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:22,909 INFO L225 Difference]: With dead ends: 95 [2021-12-21 18:16:22,909 INFO L226 Difference]: Without dead ends: 95 [2021-12-21 18:16:22,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:16:22,910 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:22,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 177 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:22,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-21 18:16:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-21 18:16:22,915 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-21 18:16:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-12-21 18:16:22,916 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2021-12-21 18:16:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:22,916 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-12-21 18:16:22,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.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-21 18:16:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-12-21 18:16:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 18:16:22,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:22,918 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:22,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:23,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:23,125 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-21 18:16:23,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2021-12-21 18:16:23,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:23,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508464460] [2021-12-21 18:16:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:23,127 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:23,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:23,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:23,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-21 18:16:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:23,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:16:23,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:23,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:23,293 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-21 18:16:23,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:23,293 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:23,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508464460] [2021-12-21 18:16:23,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508464460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:23,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:23,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:16:23,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082249788] [2021-12-21 18:16:23,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:23,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:16:23,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:16:23,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:16:23,311 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 6 states, 5 states have (on average 4.0) 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-21 18:16:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:23,523 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-21 18:16:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:16:23,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) 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-21 18:16:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:23,525 INFO L225 Difference]: With dead ends: 105 [2021-12-21 18:16:23,525 INFO L226 Difference]: Without dead ends: 105 [2021-12-21 18:16:23,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:23,526 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 76 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:23,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 243 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-21 18:16:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-12-21 18:16:23,530 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-21 18:16:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-21 18:16:23,530 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2021-12-21 18:16:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:23,530 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-21 18:16:23,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) 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-21 18:16:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-21 18:16:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 18:16:23,531 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:23,531 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:16:23,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-21 18:16:23,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:23,732 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-21 18:16:23,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2021-12-21 18:16:23,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:23,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301788117] [2021-12-21 18:16:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:23,733 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:23,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:23,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:23,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-21 18:16:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:23,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 18:16:23,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:23,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:23,963 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-21 18:16:23,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:23,964 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:23,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301788117] [2021-12-21 18:16:23,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301788117] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:23,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:23,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:16:23,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427671708] [2021-12-21 18:16:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:23,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:16:23,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:16:23,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:16:23,966 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 6 states, 5 states have (on average 4.0) 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-21 18:16:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:24,207 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-21 18:16:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:16:24,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) 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-21 18:16:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:24,210 INFO L225 Difference]: With dead ends: 84 [2021-12-21 18:16:24,210 INFO L226 Difference]: Without dead ends: 84 [2021-12-21 18:16:24,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:24,211 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 77 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:24,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 252 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-21 18:16:24,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-21 18:16:24,214 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-21 18:16:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-21 18:16:24,215 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2021-12-21 18:16:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:24,215 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-21 18:16:24,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) 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-21 18:16:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-21 18:16:24,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 18:16:24,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:24,215 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-21 18:16:24,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:24,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:24,424 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-21 18:16:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2021-12-21 18:16:24,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:24,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339968785] [2021-12-21 18:16:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:24,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:24,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:24,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:24,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-21 18:16:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:24,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 18:16:24,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:24,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:24,729 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-21 18:16:24,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2021-12-21 18:16:24,745 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-21 18:16:24,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:24,950 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-21 18:16:24,950 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:24,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339968785] [2021-12-21 18:16:24,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339968785] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:24,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:24,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-12-21 18:16:24,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401863505] [2021-12-21 18:16:24,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:24,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:16:24,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:16:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:16:24,951 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 18:16:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:25,203 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-12-21 18:16:25,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:16:25,204 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2021-12-21 18:16:25,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:25,205 INFO L225 Difference]: With dead ends: 118 [2021-12-21 18:16:25,205 INFO L226 Difference]: Without dead ends: 118 [2021-12-21 18:16:25,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:16:25,206 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 63 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:25,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 281 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2021-12-21 18:16:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-21 18:16:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2021-12-21 18:16:25,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2021-12-21 18:16:25,210 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 26 [2021-12-21 18:16:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:25,211 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2021-12-21 18:16:25,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-21 18:16:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2021-12-21 18:16:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-21 18:16:25,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:25,212 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-21 18:16:25,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-21 18:16:25,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:25,420 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-21 18:16:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2021-12-21 18:16:25,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:25,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135766851] [2021-12-21 18:16:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:25,421 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:25,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:25,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:25,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-21 18:16:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:25,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 18:16:25,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:25,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:25,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:25,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:25,843 INFO L387 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 12 treesize of output 14 [2021-12-21 18:16:25,881 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:16:25,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2021-12-21 18:16:25,941 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-21 18:16:25,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:26,217 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:26,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135766851] [2021-12-21 18:16:26,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135766851] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:26,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2114343210] [2021-12-21 18:16:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:26,218 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-21 18:16:26,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-21 18:16:26,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-21 18:16:26,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2021-12-21 18:16:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:26,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-21 18:16:26,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:26,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:26,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:28,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:28,746 INFO L387 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 12 treesize of output 14 [2021-12-21 18:16:28,753 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:16:28,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2021-12-21 18:16:28,771 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-21 18:16:28,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:28,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2114343210] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:16:28,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:28,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-21 18:16:28,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264691121] [2021-12-21 18:16:28,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:28,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 18:16:28,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:28,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 18:16:28,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:16:28,994 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:16:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:29,300 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2021-12-21 18:16:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:16:29,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2021-12-21 18:16:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:29,301 INFO L225 Difference]: With dead ends: 98 [2021-12-21 18:16:29,301 INFO L226 Difference]: Without dead ends: 98 [2021-12-21 18:16:29,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:16:29,302 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:29,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 367 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 44 Unchecked, 0.3s Time] [2021-12-21 18:16:29,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-21 18:16:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2021-12-21 18:16:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.523076923076923) internal successors, (99), 90 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2021-12-21 18:16:29,305 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 26 [2021-12-21 18:16:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:29,305 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2021-12-21 18:16:29,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:16:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2021-12-21 18:16:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:16:29,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:29,306 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-21 18:16:29,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2021-12-21 18:16:29,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-21 18:16:29,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:29,709 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-21 18:16:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2021-12-21 18:16:29,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:29,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279929073] [2021-12-21 18:16:29,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:29,710 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:29,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:29,711 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:29,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-21 18:16:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:29,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:16:29,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:29,863 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-21 18:16:29,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:29,932 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-21 18:16:29,932 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:29,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279929073] [2021-12-21 18:16:29,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279929073] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:29,932 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:29,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-21 18:16:29,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602890748] [2021-12-21 18:16:29,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:29,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:16:29,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:29,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:16:29,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:16:29,933 INFO L87 Difference]: Start difference. First operand 96 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:16:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:30,057 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-12-21 18:16:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:16:30,058 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2021-12-21 18:16:30,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:30,058 INFO L225 Difference]: With dead ends: 97 [2021-12-21 18:16:30,058 INFO L226 Difference]: Without dead ends: 97 [2021-12-21 18:16:30,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:30,059 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:30,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 394 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-21 18:16:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2021-12-21 18:16:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-12-21 18:16:30,063 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 28 [2021-12-21 18:16:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:30,063 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-12-21 18:16:30,063 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), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:16:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-12-21 18:16:30,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:16:30,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:30,064 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-21 18:16:30,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:30,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:30,271 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-21 18:16:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2021-12-21 18:16:30,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:30,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113331727] [2021-12-21 18:16:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:30,272 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:30,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:30,283 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:30,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-21 18:16:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:30,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:16:30,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:30,440 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-21 18:16:30,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:30,456 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:16:30,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2021-12-21 18:16:30,487 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-21 18:16:30,487 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:30,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113331727] [2021-12-21 18:16:30,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113331727] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:30,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:30,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-12-21 18:16:30,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813668460] [2021-12-21 18:16:30,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:30,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:16:30,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:30,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:16:30,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:16:30,489 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-21 18:16:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:30,609 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2021-12-21 18:16:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:16:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2021-12-21 18:16:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:30,610 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:16:30,610 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:16:30,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:16:30,610 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 65 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:30,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 154 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:16:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:16:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2021-12-21 18:16:30,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 93 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2021-12-21 18:16:30,614 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 29 [2021-12-21 18:16:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:30,614 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-12-21 18:16:30,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-21 18:16:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2021-12-21 18:16:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:16:30,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:30,615 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-21 18:16:30,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-21 18:16:30,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:30,829 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-21 18:16:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2021-12-21 18:16:30,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:30,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857085565] [2021-12-21 18:16:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:30,830 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:30,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:30,831 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:30,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-21 18:16:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:30,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:16:30,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:31,052 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-21 18:16:31,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:31,118 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:31,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2021-12-21 18:16:31,580 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-21 18:16:31,580 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:31,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857085565] [2021-12-21 18:16:31,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857085565] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:31,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:31,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-12-21 18:16:31,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899007982] [2021-12-21 18:16:31,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:31,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:16:31,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:31,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:16:31,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:16:31,582 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:16:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:32,278 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-12-21 18:16:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 18:16:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2021-12-21 18:16:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:32,280 INFO L225 Difference]: With dead ends: 158 [2021-12-21 18:16:32,281 INFO L226 Difference]: Without dead ends: 158 [2021-12-21 18:16:32,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-21 18:16:32,281 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 199 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:32,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 530 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 18:16:32,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-21 18:16:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 99. [2021-12-21 18:16:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.5) internal successors, (102), 93 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2021-12-21 18:16:32,287 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 29 [2021-12-21 18:16:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:32,287 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2021-12-21 18:16:32,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-21 18:16:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2021-12-21 18:16:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:16:32,288 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:32,288 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-21 18:16:32,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-21 18:16:32,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:32,489 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-21 18:16:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2021-12-21 18:16:32,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:32,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057078064] [2021-12-21 18:16:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:32,490 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:32,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:32,493 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:32,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-21 18:16:32,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:32,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:16:32,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:32,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:32,682 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-21 18:16:32,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:32,682 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:32,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057078064] [2021-12-21 18:16:32,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057078064] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:32,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:32,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:16:32,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834529293] [2021-12-21 18:16:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:32,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:16:32,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:16:32,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:32,684 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 18:16:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:32,951 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2021-12-21 18:16:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:16:32,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 18:16:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:32,952 INFO L225 Difference]: With dead ends: 119 [2021-12-21 18:16:32,952 INFO L226 Difference]: Without dead ends: 119 [2021-12-21 18:16:32,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:16:32,953 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 134 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:32,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 252 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-21 18:16:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2021-12-21 18:16:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2021-12-21 18:16:32,956 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 30 [2021-12-21 18:16:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:32,956 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2021-12-21 18:16:32,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 18:16:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2021-12-21 18:16:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:16:32,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:32,958 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-21 18:16:32,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-21 18:16:33,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:33,167 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-21 18:16:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2021-12-21 18:16:33,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:33,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403336720] [2021-12-21 18:16:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:33,168 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:33,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:33,169 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:33,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-21 18:16:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:33,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 18:16:33,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:33,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:33,422 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-21 18:16:33,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:33,422 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:33,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403336720] [2021-12-21 18:16:33,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403336720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:33,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:33,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:16:33,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154600081] [2021-12-21 18:16:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:33,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:16:33,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:16:33,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:16:33,423 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 18:16:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:33,699 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2021-12-21 18:16:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:16:33,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 18:16:33,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:33,701 INFO L225 Difference]: With dead ends: 97 [2021-12-21 18:16:33,701 INFO L226 Difference]: Without dead ends: 97 [2021-12-21 18:16:33,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:16:33,701 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 136 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:33,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 248 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:16:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-21 18:16:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-12-21 18:16:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 91 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:33,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-12-21 18:16:33,704 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 30 [2021-12-21 18:16:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:33,704 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-12-21 18:16:33,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-21 18:16:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-12-21 18:16:33,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 18:16:33,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:33,705 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-21 18:16:33,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:33,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:33,908 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-21 18:16:33,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:33,908 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2021-12-21 18:16:33,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:33,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821498625] [2021-12-21 18:16:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:33,909 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:33,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:33,910 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:33,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-21 18:16:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:34,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:16:34,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:34,124 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:34,201 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-21 18:16:34,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:34,201 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:34,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821498625] [2021-12-21 18:16:34,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821498625] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:34,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:34,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:16:34,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624358033] [2021-12-21 18:16:34,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:34,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 18:16:34,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:34,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 18:16:34,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:16:34,203 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) 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-21 18:16:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:34,655 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2021-12-21 18:16:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:16:34,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) 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-21 18:16:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:34,656 INFO L225 Difference]: With dead ends: 166 [2021-12-21 18:16:34,656 INFO L226 Difference]: Without dead ends: 166 [2021-12-21 18:16:34,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:16:34,657 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 319 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:34,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 444 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:16:34,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-21 18:16:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 100. [2021-12-21 18:16:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 94 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2021-12-21 18:16:34,659 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 35 [2021-12-21 18:16:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:34,659 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2021-12-21 18:16:34,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) 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-21 18:16:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2021-12-21 18:16:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 18:16:34,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:34,660 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-21 18:16:34,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:34,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:34,866 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-21 18:16:34,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:34,867 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2021-12-21 18:16:34,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:34,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922890546] [2021-12-21 18:16:34,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:34,867 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:34,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:34,868 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:34,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-21 18:16:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:34,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 18:16:34,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:35,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:35,219 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-21 18:16:35,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:35,219 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:35,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922890546] [2021-12-21 18:16:35,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922890546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:35,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:35,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:16:35,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170181807] [2021-12-21 18:16:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:35,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 18:16:35,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:35,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 18:16:35,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:16:35,220 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) 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-21 18:16:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:35,746 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2021-12-21 18:16:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:16:35,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) 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-21 18:16:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:35,747 INFO L225 Difference]: With dead ends: 146 [2021-12-21 18:16:35,747 INFO L226 Difference]: Without dead ends: 146 [2021-12-21 18:16:35,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-21 18:16:35,748 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 331 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:35,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 450 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-21 18:16:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-21 18:16:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2021-12-21 18:16:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2021-12-21 18:16:35,750 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 35 [2021-12-21 18:16:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:35,751 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2021-12-21 18:16:35,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) 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-21 18:16:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2021-12-21 18:16:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 18:16:35,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:35,752 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] [2021-12-21 18:16:35,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:35,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:35,958 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:35,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1296521997, now seen corresponding path program 1 times [2021-12-21 18:16:35,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:35,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470882565] [2021-12-21 18:16:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:35,959 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:35,961 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:35,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-21 18:16:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:36,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:16:36,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:36,186 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-21 18:16:36,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:36,186 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:36,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470882565] [2021-12-21 18:16:36,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470882565] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:36,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:36,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:16:36,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282466149] [2021-12-21 18:16:36,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:36,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:16:36,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:36,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:16:36,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:16:36,188 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-21 18:16:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:36,226 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2021-12-21 18:16:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:16:36,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 37 [2021-12-21 18:16:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:36,228 INFO L225 Difference]: With dead ends: 129 [2021-12-21 18:16:36,229 INFO L226 Difference]: Without dead ends: 129 [2021-12-21 18:16:36,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:16:36,229 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 89 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:36,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 169 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-21 18:16:36,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2021-12-21 18:16:36,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.452054794520548) internal successors, (106), 96 states have internal predecessors, (106), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2021-12-21 18:16:36,231 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 37 [2021-12-21 18:16:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:36,232 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2021-12-21 18:16:36,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-21 18:16:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2021-12-21 18:16:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-21 18:16:36,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:36,232 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-21 18:16:36,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:36,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:36,433 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-21 18:16:36,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:36,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2021-12-21 18:16:36,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:36,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835167659] [2021-12-21 18:16:36,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:36,433 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:36,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:36,435 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:36,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-21 18:16:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:36,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:16:36,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:36,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:16:36,667 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:36,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835167659] [2021-12-21 18:16:36,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835167659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:16:36,667 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:16:36,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:16:36,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544508110] [2021-12-21 18:16:36,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:16:36,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:16:36,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:36,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:16:36,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:16:36,669 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:16:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:36,703 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2021-12-21 18:16:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:16:36,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2021-12-21 18:16:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:36,704 INFO L225 Difference]: With dead ends: 178 [2021-12-21 18:16:36,705 INFO L226 Difference]: Without dead ends: 178 [2021-12-21 18:16:36,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:16:36,705 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 98 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:36,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 245 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:36,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-21 18:16:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 103. [2021-12-21 18:16:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.445945945945946) internal successors, (107), 97 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-21 18:16:36,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2021-12-21 18:16:36,708 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 38 [2021-12-21 18:16:36,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:36,708 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2021-12-21 18:16:36,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-21 18:16:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2021-12-21 18:16:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-21 18:16:36,708 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:36,708 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-21 18:16:36,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:36,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:36,916 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:36,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:36,917 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2021-12-21 18:16:36,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:36,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902643893] [2021-12-21 18:16:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:36,917 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:36,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:36,918 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:36,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-21 18:16:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:37,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:16:37,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 18:16:37,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:37,190 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-21 18:16:37,191 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:37,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902643893] [2021-12-21 18:16:37,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902643893] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:37,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:37,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-21 18:16:37,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019881992] [2021-12-21 18:16:37,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:37,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:16:37,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:37,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:16:37,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:16:37,192 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 18:16:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:37,204 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2021-12-21 18:16:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:16:37,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2021-12-21 18:16:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:37,205 INFO L225 Difference]: With dead ends: 91 [2021-12-21 18:16:37,205 INFO L226 Difference]: Without dead ends: 91 [2021-12-21 18:16:37,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:16:37,205 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 189 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:37,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 177 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-21 18:16:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-21 18:16:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 86 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:16:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-21 18:16:37,207 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 41 [2021-12-21 18:16:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:37,207 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-21 18:16:37,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-21 18:16:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-21 18:16:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-21 18:16:37,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:37,208 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] [2021-12-21 18:16:37,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:37,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:37,418 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-21 18:16:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116999, now seen corresponding path program 1 times [2021-12-21 18:16:37,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:37,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070860193] [2021-12-21 18:16:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:37,419 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:37,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:37,420 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:37,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-21 18:16:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:37,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:16:37,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:37,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 18:16:37,752 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070860193] [2021-12-21 18:16:37,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070860193] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:37,752 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:37,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-21 18:16:37,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864333517] [2021-12-21 18:16:37,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:37,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:16:37,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:16:37,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:16:37,753 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (4), 1 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-21 18:16:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:16:37,804 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2021-12-21 18:16:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:16:37,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (4), 1 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 42 [2021-12-21 18:16:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:16:37,805 INFO L225 Difference]: With dead ends: 137 [2021-12-21 18:16:37,805 INFO L226 Difference]: Without dead ends: 137 [2021-12-21 18:16:37,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-21 18:16:37,806 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 241 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:16:37,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 358 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:16:37,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-21 18:16:37,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2021-12-21 18:16:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.4) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-21 18:16:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2021-12-21 18:16:37,808 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 42 [2021-12-21 18:16:37,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:16:37,808 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2021-12-21 18:16:37,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (4), 1 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-21 18:16:37,809 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2021-12-21 18:16:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-21 18:16:37,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:16:37,809 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-21 18:16:37,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-21 18:16:38,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:16:38,010 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-21 18:16:38,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:16:38,010 INFO L85 PathProgramCache]: Analyzing trace with hash -960994977, now seen corresponding path program 1 times [2021-12-21 18:16:38,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:16:38,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167268620] [2021-12-21 18:16:38,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:16:38,011 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:16:38,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:16:38,012 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:16:38,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-21 18:16:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:16:38,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-21 18:16:38,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:16:38,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 18:16:38,404 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:16:38,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2021-12-21 18:16:38,452 INFO L387 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-21 18:16:38,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 18:16:38,582 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:16:38,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:16:38,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:38,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:16:38,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:16:38,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:16:38,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 18:16:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:16:38,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:16:41,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-21 18:16:41,454 INFO L353 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2021-12-21 18:16:41,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 18:16:41,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1013 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1012) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1013) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) is different from false [2021-12-21 18:16:41,495 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:16:41,495 INFO L387 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-21 18:16:41,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-21 18:16:41,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2021-12-21 18:16:41,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-21 18:16:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 18:16:42,309 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:16:42,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167268620] [2021-12-21 18:16:42,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167268620] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:16:42,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:16:42,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2021-12-21 18:16:42,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570151965] [2021-12-21 18:16:42,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:16:42,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-21 18:16:42,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:16:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-21 18:16:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=973, Unknown=4, NotChecked=126, Total=1190 [2021-12-21 18:16:42,310 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)