./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 c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/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-tmp.no-commuhash-c3fed41 [2021-12-16 06:03:24,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 06:03:24,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 06:03:24,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 06:03:24,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 06:03:24,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 06:03:24,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 06:03:24,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 06:03:24,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 06:03:24,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 06:03:24,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 06:03:24,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 06:03:24,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 06:03:24,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 06:03:24,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 06:03:24,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 06:03:24,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 06:03:24,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 06:03:24,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 06:03:24,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 06:03:24,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 06:03:24,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 06:03:24,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 06:03:24,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 06:03:24,277 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 06:03:24,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 06:03:24,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 06:03:24,279 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 06:03:24,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 06:03:24,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 06:03:24,280 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 06:03:24,281 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 06:03:24,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 06:03:24,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 06:03:24,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 06:03:24,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 06:03:24,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 06:03:24,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 06:03:24,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 06:03:24,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 06:03:24,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 06:03:24,287 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 06:03:24,311 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 06:03:24,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 06:03:24,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 06:03:24,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 06:03:24,313 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 06:03:24,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 06:03:24,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 06:03:24,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 06:03:24,314 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 06:03:24,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 06:03:24,315 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 06:03:24,315 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 06:03:24,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 06:03:24,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 06:03:24,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 06:03:24,315 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 06:03:24,315 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 06:03:24,316 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 06:03:24,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 06:03:24,316 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 06:03:24,316 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 06:03:24,316 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 06:03:24,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 06:03:24,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 06:03:24,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 06:03:24,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:03:24,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 06:03:24,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 06:03:24,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 06:03:24,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 06:03:24,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 06:03:24,318 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-16 06:03:24,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 06:03:24,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 06:03:24,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 06:03:24,577 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 06:03:24,578 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 06:03:24,579 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-16 06:03:24,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89cd00900/0557a7c6ce984765be6b814433dec384/FLAGb88a572ff [2021-12-16 06:03:25,056 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 06:03:25,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_update_all.i [2021-12-16 06:03:25,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89cd00900/0557a7c6ce984765be6b814433dec384/FLAGb88a572ff [2021-12-16 06:03:25,420 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89cd00900/0557a7c6ce984765be6b814433dec384 [2021-12-16 06:03:25,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 06:03:25,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 06:03:25,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 06:03:25,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 06:03:25,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 06:03:25,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8c62a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25, skipping insertion in model container [2021-12-16 06:03:25,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 06:03:25,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 06:03:25,770 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-16 06:03:25,774 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:03:25,786 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 06:03:25,822 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-16 06:03:25,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 06:03:25,846 INFO L208 MainTranslator]: Completed translation [2021-12-16 06:03:25,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25 WrapperNode [2021-12-16 06:03:25,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 06:03:25,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 06:03:25,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 06:03:25,849 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 06:03:25,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,900 INFO L137 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2021-12-16 06:03:25,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 06:03:25,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 06:03:25,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 06:03:25,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 06:03:25,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 06:03:25,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 06:03:25,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 06:03:25,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 06:03:25,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (1/1) ... [2021-12-16 06:03:25,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 06:03:25,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:25,975 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-16 06:03:25,991 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-16 06:03:26,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-16 06:03:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-16 06:03:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-16 06:03:26,007 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-16 06:03:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 06:03:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 06:03:26,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 06:03:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 06:03:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 06:03:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-16 06:03:26,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 06:03:26,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 06:03:26,100 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 06:03:26,101 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 06:03:26,387 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 06:03:26,392 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 06:03:26,392 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-16 06:03:26,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:03:26 BoogieIcfgContainer [2021-12-16 06:03:26,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 06:03:26,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 06:03:26,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 06:03:26,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 06:03:26,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:03:25" (1/3) ... [2021-12-16 06:03:26,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3013cdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:03:26, skipping insertion in model container [2021-12-16 06:03:26,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:03:25" (2/3) ... [2021-12-16 06:03:26,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3013cdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:03:26, skipping insertion in model container [2021-12-16 06:03:26,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:03:26" (3/3) ... [2021-12-16 06:03:26,402 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2021-12-16 06:03:26,406 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 06:03:26,406 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-16 06:03:26,438 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 06:03:26,444 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-16 06:03:26,445 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-16 06:03:26,457 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-16 06:03:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 06:03:26,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:26,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 06:03:26,464 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-16 06:03:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:26,469 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2021-12-16 06:03:26,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:26,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147101592] [2021-12-16 06:03:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:26,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:26,637 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-16 06:03:26,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:26,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147101592] [2021-12-16 06:03:26,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147101592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:26,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:26,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:03:26,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533357345] [2021-12-16 06:03:26,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:26,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:03:26,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:26,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:03:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:03:26,707 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-16 06:03:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:26,794 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-12-16 06:03:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:03:26,797 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-16 06:03:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:26,803 INFO L225 Difference]: With dead ends: 90 [2021-12-16 06:03:26,803 INFO L226 Difference]: Without dead ends: 87 [2021-12-16 06:03:26,805 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-16 06:03:26,808 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-16 06:03:26,809 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-16 06:03:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-16 06:03:26,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-12-16 06:03:26,839 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-16 06:03:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-16 06:03:26,843 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2021-12-16 06:03:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:26,843 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-16 06:03:26,843 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-16 06:03:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-16 06:03:26,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-16 06:03:26,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:26,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-16 06:03:26,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-16 06:03:26,845 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-16 06:03:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2021-12-16 06:03:26,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:26,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430201518] [2021-12-16 06:03:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:26,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:26,920 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-16 06:03:26,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:26,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430201518] [2021-12-16 06:03:26,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430201518] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:26,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:26,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 06:03:26,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793373029] [2021-12-16 06:03:26,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:26,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 06:03:26,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 06:03:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 06:03:26,925 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-16 06:03:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:26,981 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2021-12-16 06:03:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 06:03:26,982 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-16 06:03:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:26,984 INFO L225 Difference]: With dead ends: 84 [2021-12-16 06:03:26,984 INFO L226 Difference]: Without dead ends: 84 [2021-12-16 06:03:26,985 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-16 06:03:26,986 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-16 06:03:26,987 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-16 06:03:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-16 06:03:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-16 06:03:26,991 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-16 06:03:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-16 06:03:26,992 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2021-12-16 06:03:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:26,992 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-16 06:03:26,992 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-16 06:03:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-16 06:03:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-16 06:03:26,993 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:26,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:03:26,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-16 06:03:26,993 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-16 06:03:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2021-12-16 06:03:26,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:26,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520524398] [2021-12-16 06:03:26,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:26,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,084 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-16 06:03:27,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:27,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520524398] [2021-12-16 06:03:27,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520524398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:27,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:27,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 06:03:27,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580281952] [2021-12-16 06:03:27,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:27,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:03:27,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:03:27,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 06:03:27,087 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-16 06:03:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:27,153 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2021-12-16 06:03:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:03:27,154 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-16 06:03:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:27,155 INFO L225 Difference]: With dead ends: 95 [2021-12-16 06:03:27,155 INFO L226 Difference]: Without dead ends: 95 [2021-12-16 06:03:27,155 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-16 06:03:27,156 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:27,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:03:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-16 06:03:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2021-12-16 06:03:27,163 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-16 06:03:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2021-12-16 06:03:27,164 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2021-12-16 06:03:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:27,164 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2021-12-16 06:03:27,164 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-16 06:03:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2021-12-16 06:03:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 06:03:27,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:27,165 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:03:27,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-16 06:03:27,166 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-16 06:03:27,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:27,166 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2021-12-16 06:03:27,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:27,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3164650] [2021-12-16 06:03:27,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:27,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,269 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-16 06:03:27,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:27,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3164650] [2021-12-16 06:03:27,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3164650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:27,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:27,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:03:27,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846161396] [2021-12-16 06:03:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:27,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:03:27,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:03:27,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:03:27,272 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-16 06:03:27,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:27,415 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-12-16 06:03:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:03:27,416 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-16 06:03:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:27,418 INFO L225 Difference]: With dead ends: 105 [2021-12-16 06:03:27,418 INFO L226 Difference]: Without dead ends: 105 [2021-12-16 06:03:27,418 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-16 06:03:27,419 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-16 06:03:27,420 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-16 06:03:27,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-16 06:03:27,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2021-12-16 06:03:27,424 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-16 06:03:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-16 06:03:27,425 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2021-12-16 06:03:27,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:27,425 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-16 06:03:27,426 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-16 06:03:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-16 06:03:27,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-16 06:03:27,426 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:27,427 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:03:27,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-16 06:03:27,427 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-16 06:03:27,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2021-12-16 06:03:27,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:27,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321530660] [2021-12-16 06:03:27,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:27,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,538 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-16 06:03:27,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:27,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321530660] [2021-12-16 06:03:27,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321530660] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:27,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:27,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 06:03:27,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210997090] [2021-12-16 06:03:27,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:27,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:03:27,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:27,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:03:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:03:27,541 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-16 06:03:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:27,668 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-12-16 06:03:27,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:03:27,669 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-16 06:03:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:27,670 INFO L225 Difference]: With dead ends: 84 [2021-12-16 06:03:27,670 INFO L226 Difference]: Without dead ends: 84 [2021-12-16 06:03:27,671 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-16 06:03:27,671 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-16 06:03:27,672 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-16 06:03:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-16 06:03:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2021-12-16 06:03:27,675 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-16 06:03:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-16 06:03:27,676 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2021-12-16 06:03:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:27,677 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-16 06:03:27,677 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-16 06:03:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-16 06:03:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 06:03:27,678 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:27,678 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-16 06:03:27,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-16 06:03:27,678 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-16 06:03:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:27,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2021-12-16 06:03:27,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:27,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968252695] [2021-12-16 06:03:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:27,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,806 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-16 06:03:27,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:27,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968252695] [2021-12-16 06:03:27,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968252695] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:27,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477272618] [2021-12-16 06:03:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:27,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:27,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:27,826 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-16 06:03:27,844 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-16 06:03:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:27,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 06:03:27,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:27,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:03:28,176 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-16 06:03:28,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-16 06:03:28,190 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-16 06:03:28,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:28,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477272618] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:28,249 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:03:28,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-12-16 06:03:28,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544350684] [2021-12-16 06:03:28,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:28,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:03:28,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:28,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:03:28,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:03:28,251 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-16 06:03:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:28,426 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2021-12-16 06:03:28,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:03:28,427 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-16 06:03:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:28,428 INFO L225 Difference]: With dead ends: 110 [2021-12-16 06:03:28,428 INFO L226 Difference]: Without dead ends: 110 [2021-12-16 06:03:28,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-16 06:03:28,428 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:28,429 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.1s Time] [2021-12-16 06:03:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-16 06:03:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2021-12-16 06:03:28,432 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-16 06:03:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-16 06:03:28,432 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2021-12-16 06:03:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:28,432 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-16 06:03:28,433 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-16 06:03:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-16 06:03:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-16 06:03:28,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:28,433 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-16 06:03:28,453 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-16 06:03:28,634 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-16 06:03:28,634 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-16 06:03:28,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:28,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2021-12-16 06:03:28,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:28,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772519473] [2021-12-16 06:03:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:28,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:28,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:28,782 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-16 06:03:28,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:28,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772519473] [2021-12-16 06:03:28,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772519473] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:28,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189772619] [2021-12-16 06:03:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:28,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:28,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:28,800 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-16 06:03:28,825 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-16 06:03:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:28,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-16 06:03:28,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:28,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:03:28,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:03:29,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:03:29,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 06:03:29,249 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:03:29,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:03:29,276 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-16 06:03:29,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:29,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189772619] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:29,375 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:03:29,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-12-16 06:03:29,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112240457] [2021-12-16 06:03:29,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:29,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-16 06:03:29,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:29,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-16 06:03:29,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-12-16 06:03:29,377 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 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-16 06:03:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:29,603 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2021-12-16 06:03:29,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:03:29,605 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 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-16 06:03:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:29,606 INFO L225 Difference]: With dead ends: 90 [2021-12-16 06:03:29,606 INFO L226 Difference]: Without dead ends: 90 [2021-12-16 06:03:29,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-12-16 06:03:29,607 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 5 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:29,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 556 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2021-12-16 06:03:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-16 06:03:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2021-12-16 06:03:29,610 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-16 06:03:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2021-12-16 06:03:29,611 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2021-12-16 06:03:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:29,612 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2021-12-16 06:03:29,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 12 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-16 06:03:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2021-12-16 06:03:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-16 06:03:29,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:29,613 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-16 06:03:29,653 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-16 06:03:29,823 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-16 06:03:29,824 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-16 06:03:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2021-12-16 06:03:29,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:29,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103312199] [2021-12-16 06:03:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:29,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:29,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:29,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:29,895 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-16 06:03:29,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103312199] [2021-12-16 06:03:29,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103312199] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:29,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338305371] [2021-12-16 06:03:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:29,896 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:29,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:29,911 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-16 06:03:29,943 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-16 06:03:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:30,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-16 06:03:30,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:30,073 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-16 06:03:30,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:30,131 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-16 06:03:30,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338305371] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:03:30,131 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:03:30,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-16 06:03:30,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933553757] [2021-12-16 06:03:30,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:30,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:03:30,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:03:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:03:30,134 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-16 06:03:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:30,222 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2021-12-16 06:03:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:03:30,222 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-16 06:03:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:30,223 INFO L225 Difference]: With dead ends: 89 [2021-12-16 06:03:30,223 INFO L226 Difference]: Without dead ends: 89 [2021-12-16 06:03:30,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:03:30,224 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-16 06:03:30,224 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-16 06:03:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-16 06:03:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2021-12-16 06:03:30,226 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-16 06:03:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2021-12-16 06:03:30,227 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2021-12-16 06:03:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:30,227 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2021-12-16 06:03:30,227 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-16 06:03:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2021-12-16 06:03:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 06:03:30,228 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:30,228 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-16 06:03:30,269 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-16 06:03:30,443 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-16 06:03:30,443 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-16 06:03:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2021-12-16 06:03:30,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:30,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408459365] [2021-12-16 06:03:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:30,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:30,538 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-16 06:03:30,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:30,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408459365] [2021-12-16 06:03:30,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408459365] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:30,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638885795] [2021-12-16 06:03:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:30,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:30,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:30,556 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-16 06:03:30,571 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-16 06:03:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:30,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 06:03:30,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:30,714 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-16 06:03:30,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:30,735 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-16 06:03:30,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2021-12-16 06:03:30,777 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-16 06:03:30,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638885795] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:03:30,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:03:30,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2021-12-16 06:03:30,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369121917] [2021-12-16 06:03:30,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:30,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:03:30,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:30,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:03:30,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:03:30,780 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-16 06:03:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:30,895 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2021-12-16 06:03:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 06:03:30,896 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-16 06:03:30,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:30,897 INFO L225 Difference]: With dead ends: 113 [2021-12-16 06:03:30,897 INFO L226 Difference]: Without dead ends: 113 [2021-12-16 06:03:30,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:03:30,898 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 124 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:30,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 224 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:03:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-16 06:03:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2021-12-16 06:03:30,901 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-16 06:03:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2021-12-16 06:03:30,901 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2021-12-16 06:03:30,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:30,902 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2021-12-16 06:03:30,902 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-16 06:03:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2021-12-16 06:03:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-16 06:03:30,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:30,903 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-16 06:03:30,926 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-16 06:03:31,122 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-16 06:03:31,122 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-16 06:03:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2021-12-16 06:03:31,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:31,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918022409] [2021-12-16 06:03:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:31,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:31,283 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-16 06:03:31,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:31,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918022409] [2021-12-16 06:03:31,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918022409] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:31,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358428532] [2021-12-16 06:03:31,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:31,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:31,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:31,285 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-16 06:03:31,311 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-16 06:03:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:31,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 06:03:31,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:31,494 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-16 06:03:31,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:31,524 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:03:31,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2021-12-16 06:03:31,639 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-16 06:03:31,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358428532] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:03:31,640 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:03:31,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2021-12-16 06:03:31,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845606237] [2021-12-16 06:03:31,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:31,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-16 06:03:31,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-16 06:03:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-12-16 06:03:31,652 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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-16 06:03:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:31,897 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-12-16 06:03:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:03:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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-16 06:03:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:31,899 INFO L225 Difference]: With dead ends: 150 [2021-12-16 06:03:31,899 INFO L226 Difference]: Without dead ends: 150 [2021-12-16 06:03:31,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-12-16 06:03:31,899 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 138 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:31,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 695 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:03:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-16 06:03:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2021-12-16 06:03:31,902 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-16 06:03:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2021-12-16 06:03:31,903 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2021-12-16 06:03:31,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:31,903 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2021-12-16 06:03:31,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 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-16 06:03:31,903 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2021-12-16 06:03:31,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 06:03:31,904 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:31,904 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-16 06:03:31,922 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-16 06:03:32,124 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-16 06:03:32,124 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-16 06:03:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2021-12-16 06:03:32,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:32,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99927611] [2021-12-16 06:03:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:32,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,193 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-16 06:03:32,193 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:32,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99927611] [2021-12-16 06:03:32,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99927611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:32,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:32,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:03:32,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614985880] [2021-12-16 06:03:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:32,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:03:32,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:32,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:03:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:03:32,195 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-16 06:03:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:32,305 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-12-16 06:03:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:03:32,306 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-16 06:03:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:32,306 INFO L225 Difference]: With dead ends: 111 [2021-12-16 06:03:32,306 INFO L226 Difference]: Without dead ends: 111 [2021-12-16 06:03:32,306 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-16 06:03:32,307 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-16 06:03:32,307 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-16 06:03:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-16 06:03:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2021-12-16 06:03:32,309 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-16 06:03:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2021-12-16 06:03:32,309 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2021-12-16 06:03:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:32,309 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2021-12-16 06:03:32,309 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-16 06:03:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2021-12-16 06:03:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-16 06:03:32,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:32,310 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-16 06:03:32,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-16 06:03:32,310 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-16 06:03:32,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2021-12-16 06:03:32,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:32,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007308618] [2021-12-16 06:03:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:32,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,442 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-16 06:03:32,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:32,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007308618] [2021-12-16 06:03:32,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007308618] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:32,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:32,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 06:03:32,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645693691] [2021-12-16 06:03:32,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:32,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:03:32,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:03:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:03:32,443 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-16 06:03:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:32,548 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2021-12-16 06:03:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 06:03:32,548 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-16 06:03:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:32,549 INFO L225 Difference]: With dead ends: 89 [2021-12-16 06:03:32,549 INFO L226 Difference]: Without dead ends: 89 [2021-12-16 06:03:32,549 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-16 06:03:32,549 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-16 06:03:32,549 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-16 06:03:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-16 06:03:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-16 06:03:32,551 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-16 06:03:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2021-12-16 06:03:32,551 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2021-12-16 06:03:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:32,551 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2021-12-16 06:03:32,551 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-16 06:03:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2021-12-16 06:03:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 06:03:32,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:32,552 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-16 06:03:32,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-16 06:03:32,552 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-16 06:03:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2021-12-16 06:03:32,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:32,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123513684] [2021-12-16 06:03:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:32,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:32,660 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-16 06:03:32,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:32,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123513684] [2021-12-16 06:03:32,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123513684] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:32,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:32,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 06:03:32,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940075415] [2021-12-16 06:03:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:32,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:03:32,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:32,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:03:32,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:03:32,663 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-16 06:03:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:32,952 INFO L93 Difference]: Finished difference Result 158 states and 173 transitions. [2021-12-16 06:03:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:03:32,952 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-16 06:03:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:32,953 INFO L225 Difference]: With dead ends: 158 [2021-12-16 06:03:32,953 INFO L226 Difference]: Without dead ends: 158 [2021-12-16 06:03:32,953 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-16 06:03:32,954 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-16 06:03:32,954 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-16 06:03:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-16 06:03:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2021-12-16 06:03:32,956 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-16 06:03:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-16 06:03:32,957 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2021-12-16 06:03:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:32,957 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-16 06:03:32,957 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-16 06:03:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-16 06:03:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-16 06:03:32,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03: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, 1, 1, 1, 1, 1] [2021-12-16 06:03:32,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-16 06:03:32,958 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-16 06:03:32,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash 452746568, now seen corresponding path program 1 times [2021-12-16 06:03:32,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:32,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999321459] [2021-12-16 06:03:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:32,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,096 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-16 06:03:33,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999321459] [2021-12-16 06:03:33,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999321459] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:33,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:33,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-16 06:03:33,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819102445] [2021-12-16 06:03:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:33,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-16 06:03:33,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-16 06:03:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-16 06:03:33,098 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-16 06:03:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:33,341 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2021-12-16 06:03:33,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:03:33,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-16 06:03:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:33,342 INFO L225 Difference]: With dead ends: 138 [2021-12-16 06:03:33,342 INFO L226 Difference]: Without dead ends: 138 [2021-12-16 06:03:33,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-12-16 06:03:33,343 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 337 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:33,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 520 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:03:33,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-16 06:03:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2021-12-16 06:03:33,345 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-16 06:03:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2021-12-16 06:03:33,345 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 35 [2021-12-16 06:03:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:33,345 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2021-12-16 06:03:33,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 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-16 06:03:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2021-12-16 06:03:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-16 06:03:33,346 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:33,346 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-16 06:03:33,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-16 06:03:33,346 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-16 06:03:33,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1296521997, now seen corresponding path program 1 times [2021-12-16 06:03:33,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:33,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454873725] [2021-12-16 06:03:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:33,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,422 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-16 06:03:33,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:33,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454873725] [2021-12-16 06:03:33,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454873725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:33,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:33,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:03:33,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392553098] [2021-12-16 06:03:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:33,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:03:33,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:33,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:03:33,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:03:33,426 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-16 06:03:33,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:33,469 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2021-12-16 06:03:33,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 06:03:33,470 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-16 06:03:33,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:33,472 INFO L225 Difference]: With dead ends: 121 [2021-12-16 06:03:33,472 INFO L226 Difference]: Without dead ends: 121 [2021-12-16 06:03:33,473 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-16 06:03:33,477 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-16 06:03:33,478 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-16 06:03:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-16 06:03:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 94. [2021-12-16 06:03:33,481 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-16 06:03:33,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2021-12-16 06:03:33,481 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 37 [2021-12-16 06:03:33,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:33,482 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2021-12-16 06:03:33,482 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-16 06:03:33,482 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2021-12-16 06:03:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-16 06:03:33,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:33,485 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-16 06:03:33,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-16 06:03:33,485 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-16 06:03:33,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2021-12-16 06:03:33,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:33,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165791092] [2021-12-16 06:03:33,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:33,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,555 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-16 06:03:33,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:33,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165791092] [2021-12-16 06:03:33,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165791092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:33,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:33,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:03:33,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565237609] [2021-12-16 06:03:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:33,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:03:33,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:33,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:03:33,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:03:33,556 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-16 06:03:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:33,605 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2021-12-16 06:03:33,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:03:33,606 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-16 06:03:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:33,606 INFO L225 Difference]: With dead ends: 170 [2021-12-16 06:03:33,606 INFO L226 Difference]: Without dead ends: 170 [2021-12-16 06:03:33,607 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-16 06:03:33,607 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 98 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:33,607 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.0s Time] [2021-12-16 06:03:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-16 06:03:33,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 95. [2021-12-16 06:03:33,609 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-16 06:03:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2021-12-16 06:03:33,610 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 38 [2021-12-16 06:03:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:33,610 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2021-12-16 06:03:33,610 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-16 06:03:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2021-12-16 06:03:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-16 06:03:33,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:33,611 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-16 06:03:33,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-16 06:03:33,611 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-16 06:03:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2021-12-16 06:03:33,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:33,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750189394] [2021-12-16 06:03:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:33,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-12-16 06:03:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,690 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-16 06:03:33,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:33,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750189394] [2021-12-16 06:03:33,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750189394] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:33,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757982508] [2021-12-16 06:03:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:33,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:33,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:33,708 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-16 06:03:33,723 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-16 06:03:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:33,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:03:33,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:33,912 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-16 06:03:33,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:03:33,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757982508] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:33,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:03:33,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-16 06:03:33,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204363765] [2021-12-16 06:03:33,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:33,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 06:03:33,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 06:03:33,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 06:03:33,915 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-16 06:03:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:33,921 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-12-16 06:03:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 06:03:33,921 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-16 06:03:33,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:33,922 INFO L225 Difference]: With dead ends: 83 [2021-12-16 06:03:33,922 INFO L226 Difference]: Without dead ends: 83 [2021-12-16 06:03:33,922 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-16 06:03:33,923 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 126 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:33,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 95 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:03:33,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-16 06:03:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2021-12-16 06:03:33,924 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-16 06:03:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-12-16 06:03:33,925 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 41 [2021-12-16 06:03:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:33,925 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-12-16 06:03:33,925 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-16 06:03:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-12-16 06:03:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-16 06:03:33,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:33,926 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-16 06:03:33,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-16 06:03:34,131 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-16 06:03:34,132 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-16 06:03:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116999, now seen corresponding path program 1 times [2021-12-16 06:03:34,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:34,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92379126] [2021-12-16 06:03:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:34,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:34,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:34,220 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-16 06:03:34,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:34,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92379126] [2021-12-16 06:03:34,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92379126] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:34,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:34,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-16 06:03:34,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086924116] [2021-12-16 06:03:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:34,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:03:34,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:34,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:03:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:03:34,221 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-16 06:03:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:34,372 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2021-12-16 06:03:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:03:34,372 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-16 06:03:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:34,373 INFO L225 Difference]: With dead ends: 108 [2021-12-16 06:03:34,373 INFO L226 Difference]: Without dead ends: 108 [2021-12-16 06:03:34,373 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-16 06:03:34,374 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.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:34,374 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.1s Time] [2021-12-16 06:03:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-16 06:03:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2021-12-16 06:03:34,375 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-16 06:03:34,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2021-12-16 06:03:34,376 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 42 [2021-12-16 06:03:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:34,376 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2021-12-16 06:03:34,376 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-16 06:03:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2021-12-16 06:03:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-16 06:03:34,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:34,376 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-16 06:03:34,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-16 06:03:34,377 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-16 06:03:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1002116998, now seen corresponding path program 1 times [2021-12-16 06:03:34,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:34,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580084485] [2021-12-16 06:03:34,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:34,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:34,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:34,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:34,442 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-16 06:03:34,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:34,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580084485] [2021-12-16 06:03:34,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580084485] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:34,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391444005] [2021-12-16 06:03:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:34,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:34,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:34,448 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-16 06:03:34,455 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-16 06:03:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:34,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 06:03:34,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:34,691 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-16 06:03:34,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:34,760 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-16 06:03:34,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391444005] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:03:34,761 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:03:34,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-12-16 06:03:34,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295370004] [2021-12-16 06:03:34,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:34,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:03:34,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:34,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:03:34,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:03:34,762 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-16 06:03:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:34,817 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2021-12-16 06:03:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:03:34,818 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-16 06:03:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:34,818 INFO L225 Difference]: With dead ends: 108 [2021-12-16 06:03:34,818 INFO L226 Difference]: Without dead ends: 108 [2021-12-16 06:03:34,818 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-16 06:03:34,819 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 148 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:34,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 293 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:03:34,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-16 06:03:34,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2021-12-16 06:03:34,820 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-16 06:03:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2021-12-16 06:03:34,821 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 42 [2021-12-16 06:03:34,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:34,821 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2021-12-16 06:03:34,821 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-16 06:03:34,821 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2021-12-16 06:03:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 06:03:34,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:34,821 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-16 06:03:34,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-16 06:03:35,031 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-16 06:03:35,032 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-16 06:03:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash -960994977, now seen corresponding path program 1 times [2021-12-16 06:03:35,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:35,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428743692] [2021-12-16 06:03:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:35,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:35,342 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-16 06:03:35,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:35,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428743692] [2021-12-16 06:03:35,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428743692] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:35,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500326075] [2021-12-16 06:03:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:35,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:35,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:35,344 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-16 06:03:35,385 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-16 06:03:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:35,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-16 06:03:35,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:35,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:03:35,626 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:03:35,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:03:35,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 06:03:35,712 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:03:35,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-16 06:03:35,790 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:03:35,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-16 06:03:35,827 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:03:35,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2021-12-16 06:03:35,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:03:35,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-16 06:03:36,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-16 06:03:36,030 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-16 06:03:36,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:39,202 INFO L354 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-16 06:03:39,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-16 06:03:39,206 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2202 (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_2202) |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-16 06:03:39,214 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2202 (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_2202) |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-16 06:03:39,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2202 (Array Int Int)) (v_ArrVal_2201 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2201) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2202) |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-16 06:03:39,229 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:03:39,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-16 06:03:39,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-16 06:03:39,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2021-12-16 06:03:39,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-16 06:03:39,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500326075] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:39,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:03:39,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 35 [2021-12-16 06:03:39,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089736569] [2021-12-16 06:03:39,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:39,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-16 06:03:39,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:39,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-16 06:03:39,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1458, Unknown=4, NotChecked=234, Total=1806 [2021-12-16 06:03:39,362 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 31 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 06:03:40,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:40,519 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2021-12-16 06:03:40,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-16 06:03:40,520 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 31 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2021-12-16 06:03:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:40,522 INFO L225 Difference]: With dead ends: 220 [2021-12-16 06:03:40,522 INFO L226 Difference]: Without dead ends: 220 [2021-12-16 06:03:40,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=298, Invalid=2362, Unknown=4, NotChecked=306, Total=2970 [2021-12-16 06:03:40,524 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 1092 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:40,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1092 Valid, 1158 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-16 06:03:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-16 06:03:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2021-12-16 06:03:40,527 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-16 06:03:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2021-12-16 06:03:40,528 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 43 [2021-12-16 06:03:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:40,528 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2021-12-16 06:03:40,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 31 states have internal predecessors, (67), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 06:03:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2021-12-16 06:03:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-16 06:03:40,529 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:40,529 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-16 06:03:40,555 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-16 06:03:40,743 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-16 06:03:40,743 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-16 06:03:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash -960994976, now seen corresponding path program 1 times [2021-12-16 06:03:40,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:40,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685128795] [2021-12-16 06:03:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:40,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:41,237 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-16 06:03:41,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:41,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685128795] [2021-12-16 06:03:41,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685128795] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:41,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286182766] [2021-12-16 06:03:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:41,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:41,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:41,247 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-16 06:03:41,248 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-16 06:03:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:41,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 91 conjunts are in the unsatisfiable core [2021-12-16 06:03:41,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:41,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:03:41,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:03:41,797 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:03:41,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:03:41,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 06:03:41,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:03:41,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-16 06:03:41,964 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:03:41,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2021-12-16 06:03:41,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-16 06:03:42,105 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:03:42,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-16 06:03:42,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-16 06:03:42,158 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:03:42,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2021-12-16 06:03:42,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:03:42,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:03:42,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:03:42,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-16 06:03:42,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:03:42,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-16 06:03:42,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-16 06:03:42,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-16 06:03:42,578 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-16 06:03:42,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:44,954 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_2403 Int) (v_ArrVal_2402 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_main_~s~0#1.base|) .cse0 v_ArrVal_2402) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2403) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_2402 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| 8) v_ArrVal_2402) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-16 06:03:46,988 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_2402 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_2402) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 8))) (forall ((v_ArrVal_2403 Int) (v_ArrVal_2402 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_2402) |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_2403) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))) (< |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-16 06:03:49,010 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_2402 Int)) (<= 0 (+ (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_2402) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8))) (forall ((v_ArrVal_2403 Int) (v_ArrVal_2402 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_~head~0#1.base|) .cse0 v_ArrVal_2402) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_2403) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_14| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-16 06:03:49,555 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:03:49,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 90 [2021-12-16 06:03:49,562 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:03:49,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 90 [2021-12-16 06:03:49,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 231 treesize of output 227 [2021-12-16 06:03:49,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1434 treesize of output 1414 [2021-12-16 06:03:49,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,577 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1324 treesize of output 1304 [2021-12-16 06:03:49,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1224 treesize of output 1206 [2021-12-16 06:03:49,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1117 treesize of output 1101 [2021-12-16 06:03:49,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 941 treesize of output 909 [2021-12-16 06:03:49,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 829 treesize of output 813 [2021-12-16 06:03:49,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 653 treesize of output 621 [2021-12-16 06:03:49,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 601 treesize of output 597 [2021-12-16 06:03:49,656 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:49,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 585 [2021-12-16 06:03:51,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286182766] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:51,577 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:03:51,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 41 [2021-12-16 06:03:51,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534847829] [2021-12-16 06:03:51,577 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:51,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-16 06:03:51,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-16 06:03:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2711, Unknown=4, NotChecked=318, Total=3192 [2021-12-16 06:03:51,579 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 36 states have internal predecessors, (76), 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-16 06:03:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:53,249 INFO L93 Difference]: Finished difference Result 252 states and 309 transitions. [2021-12-16 06:03:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 06:03:53,250 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 36 states have internal predecessors, (76), 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 43 [2021-12-16 06:03:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:53,251 INFO L225 Difference]: With dead ends: 252 [2021-12-16 06:03:53,251 INFO L226 Difference]: Without dead ends: 252 [2021-12-16 06:03:53,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=346, Invalid=4084, Unknown=4, NotChecked=396, Total=4830 [2021-12-16 06:03:53,252 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 1400 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:53,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1400 Valid, 2302 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1576 Invalid, 0 Unknown, 123 Unchecked, 0.8s Time] [2021-12-16 06:03:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-16 06:03:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 120. [2021-12-16 06:03:53,255 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-16 06:03:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2021-12-16 06:03:53,255 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 43 [2021-12-16 06:03:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:53,257 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2021-12-16 06:03:53,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 36 states have internal predecessors, (76), 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-16 06:03:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2021-12-16 06:03:53,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-16 06:03:53,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:53,258 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-16 06:03:53,278 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-16 06:03:53,463 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-16 06:03:53,463 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-16 06:03:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1252304435, now seen corresponding path program 2 times [2021-12-16 06:03:53,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:53,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777507333] [2021-12-16 06:03:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:53,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:53,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:53,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:53,538 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-16 06:03:53,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:53,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777507333] [2021-12-16 06:03:53,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777507333] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:53,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142829691] [2021-12-16 06:03:53,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 06:03:53,539 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:53,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:53,540 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-16 06:03:53,555 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-16 06:03:53,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 06:03:53,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 06:03:53,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 06:03:53,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:53,799 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-16 06:03:53,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:53,883 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-16 06:03:53,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142829691] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:03:53,884 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:03:53,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-16 06:03:53,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303644026] [2021-12-16 06:03:53,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:53,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:03:53,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:53,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:03:53,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:03:53,885 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-16 06:03:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:53,963 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2021-12-16 06:03:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 06:03:53,965 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-16 06:03:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:53,965 INFO L225 Difference]: With dead ends: 112 [2021-12-16 06:03:53,965 INFO L226 Difference]: Without dead ends: 112 [2021-12-16 06:03:53,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-12-16 06:03:53,966 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-16 06:03:53,966 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-16 06:03:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-16 06:03:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2021-12-16 06:03:53,974 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-16 06:03:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2021-12-16 06:03:53,974 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 46 [2021-12-16 06:03:53,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:53,974 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2021-12-16 06:03:53,974 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-16 06:03:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2021-12-16 06:03:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-16 06:03:53,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:53,975 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-16 06:03:53,993 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-16 06:03:54,181 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-16 06:03:54,182 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-16 06:03:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676750, now seen corresponding path program 2 times [2021-12-16 06:03:54,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:54,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004186968] [2021-12-16 06:03:54,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:54,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:54,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:54,232 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-16 06:03:54,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:54,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004186968] [2021-12-16 06:03:54,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004186968] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:54,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679260061] [2021-12-16 06:03:54,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 06:03:54,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:54,234 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-16 06:03:54,235 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-16 06:03:54,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-16 06:03:54,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 06:03:54,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-16 06:03:54,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:54,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:03:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-16 06:03:54,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:03:54,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679260061] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:54,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:03:54,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 15 [2021-12-16 06:03:54,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421944144] [2021-12-16 06:03:54,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:54,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-16 06:03:54,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:54,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 06:03:54,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2021-12-16 06:03:54,653 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-16 06:03:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:54,835 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2021-12-16 06:03:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 06:03:54,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-16 06:03:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:54,836 INFO L225 Difference]: With dead ends: 147 [2021-12-16 06:03:54,836 INFO L226 Difference]: Without dead ends: 147 [2021-12-16 06:03:54,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-12-16 06:03:54,837 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 520 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:54,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 272 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:03:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-16 06:03:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2021-12-16 06:03:54,839 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-16 06:03:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2021-12-16 06:03:54,839 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 47 [2021-12-16 06:03:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:54,839 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2021-12-16 06:03:54,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-16 06:03:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2021-12-16 06:03:54,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-16 06:03:54,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:54,840 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-16 06:03:54,871 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-16 06:03:55,069 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-16 06:03:55,069 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-16 06:03:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:55,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1996676805, now seen corresponding path program 1 times [2021-12-16 06:03:55,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:55,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206900400] [2021-12-16 06:03:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:55,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,118 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-16 06:03:55,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:55,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206900400] [2021-12-16 06:03:55,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206900400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:55,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 06:03:55,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-16 06:03:55,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640467251] [2021-12-16 06:03:55,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:55,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 06:03:55,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:55,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 06:03:55,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 06:03:55,120 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-16 06:03:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:55,163 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-16 06:03:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:03:55,163 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-16 06:03:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:55,164 INFO L225 Difference]: With dead ends: 103 [2021-12-16 06:03:55,164 INFO L226 Difference]: Without dead ends: 103 [2021-12-16 06:03:55,164 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-16 06:03:55,164 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-16 06:03:55,165 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-16 06:03:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-16 06:03:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-12-16 06:03:55,166 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-16 06:03:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2021-12-16 06:03:55,175 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 47 [2021-12-16 06:03:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:55,175 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2021-12-16 06:03:55,175 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-16 06:03:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2021-12-16 06:03:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-16 06:03:55,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:55,176 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-16 06:03:55,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-16 06:03:55,176 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-16 06:03:55,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:55,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1716069023, now seen corresponding path program 1 times [2021-12-16 06:03:55,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:55,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380029412] [2021-12-16 06:03:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:55,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,244 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-16 06:03:55,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:55,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380029412] [2021-12-16 06:03:55,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380029412] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:55,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061233283] [2021-12-16 06:03:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:55,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:55,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:55,246 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-16 06:03:55,247 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-16 06:03:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:03:55,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:55,512 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-16 06:03:55,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:55,585 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-16 06:03:55,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061233283] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:03:55,585 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:03:55,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-16 06:03:55,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027441482] [2021-12-16 06:03:55,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:55,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:03:55,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:55,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:03:55,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:03:55,587 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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-16 06:03:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:55,659 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-12-16 06:03:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:03:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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-16 06:03:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:55,660 INFO L225 Difference]: With dead ends: 99 [2021-12-16 06:03:55,660 INFO L226 Difference]: Without dead ends: 99 [2021-12-16 06:03:55,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:03:55,660 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 116 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:55,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 285 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:03:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-16 06:03:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-16 06:03:55,662 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-16 06:03:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-16 06:03:55,662 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2021-12-16 06:03:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:55,662 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-16 06:03:55,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 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-16 06:03:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-16 06:03:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-16 06:03:55,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:55,663 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-16 06:03:55,683 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-16 06:03:55,875 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-16 06:03:55,875 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-16 06:03:55,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash -291844745, now seen corresponding path program 3 times [2021-12-16 06:03:55,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:55,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478342951] [2021-12-16 06:03:55,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:55,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:55,951 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-16 06:03:55,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:55,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478342951] [2021-12-16 06:03:55,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478342951] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:55,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270837375] [2021-12-16 06:03:55,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 06:03:55,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:55,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:55,955 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-16 06:03:55,957 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-16 06:03:56,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-16 06:03:56,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 06:03:56,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:03:56,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:56,637 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-16 06:03:56,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 06:03:56,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270837375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 06:03:56,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-16 06:03:56,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2021-12-16 06:03:56,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52701000] [2021-12-16 06:03:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 06:03:56,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-16 06:03:56,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:56,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 06:03:56,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:03:56,639 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-16 06:03:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:03:56,657 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2021-12-16 06:03:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:03:56,658 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-16 06:03:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:03:56,658 INFO L225 Difference]: With dead ends: 93 [2021-12-16 06:03:56,658 INFO L226 Difference]: Without dead ends: 93 [2021-12-16 06:03:56,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-16 06:03:56,659 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 67 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 06:03:56,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 175 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 06:03:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-16 06:03:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-16 06:03:56,661 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-16 06:03:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-16 06:03:56,661 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 51 [2021-12-16 06:03:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:03:56,661 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-16 06:03:56,662 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-16 06:03:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-16 06:03:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-16 06:03:56,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:03:56,662 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-16 06:03:56,683 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-16 06:03:56,872 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-16 06:03:56,872 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-16 06:03:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:03:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash 878531443, now seen corresponding path program 1 times [2021-12-16 06:03:56,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:03:56,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541166362] [2021-12-16 06:03:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:56,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:03:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:57,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:03:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:57,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:03:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:57,383 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-16 06:03:57,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:03:57,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541166362] [2021-12-16 06:03:57,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541166362] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:03:57,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944452183] [2021-12-16 06:03:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:03:57,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:03:57,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:03:57,385 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-16 06:03:57,386 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-16 06:03:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:03:57,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-16 06:03:57,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:03:57,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:03:57,775 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:03:57,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:03:57,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:03:57,877 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:03:57,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-16 06:03:57,952 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:03:57,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-16 06:03:57,994 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:03:57,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-16 06:03:58,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 06:03:58,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:03:58,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-16 06:03:58,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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-16 06:03:58,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-16 06:03:58,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 06:03:58,558 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-16 06:03:58,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:03:58,756 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3485 (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_3485) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) (forall ((v_ArrVal_3485 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3485) |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-16 06:03:58,766 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3485 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3485) |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_3485 (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_3485) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-16 06:03:58,773 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3485 (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_3485) |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_3485 (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_3485) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8))))) is different from false [2021-12-16 06:03:58,787 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3485 (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_3485) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8)))) (forall ((v_ArrVal_3485 (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_3485) |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-16 06:03:58,807 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:03:58,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-16 06:03:58,815 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:03:58,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2021-12-16 06:03:58,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-16 06:03:58,853 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:03:58,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-16 06:03:58,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:03:58,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2021-12-16 06:03:58,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-16 06:03:59,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3483 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_3478) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 8) v_ArrVal_3483) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-16 06:03:59,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3483 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_3478) |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_3483) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-16 06:03:59,076 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3478 (Array Int Int)) (v_ArrVal_3483 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_3477) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3478) |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_3483) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2021-12-16 06:03:59,084 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:03:59,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-16 06:03:59,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-16 06:03:59,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:03:59,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2021-12-16 06:03:59,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2021-12-16 06:03:59,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-16 06:03:59,457 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-16 06:03:59,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944452183] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:03:59,457 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:03:59,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 28] total 75 [2021-12-16 06:03:59,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286618700] [2021-12-16 06:03:59,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:03:59,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2021-12-16 06:03:59,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:03:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2021-12-16 06:03:59,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=4339, Unknown=7, NotChecked=966, Total=5550 [2021-12-16 06:03:59,459 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-16 06:04:01,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:01,079 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-12-16 06:04:01,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-16 06:04:01,080 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-16 06:04:01,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:01,081 INFO L225 Difference]: With dead ends: 91 [2021-12-16 06:04:01,081 INFO L226 Difference]: Without dead ends: 91 [2021-12-16 06:04:01,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 95 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1743 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=534, Invalid=7497, Unknown=7, NotChecked=1274, Total=9312 [2021-12-16 06:04:01,085 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 229 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 745 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:01,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 1934 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1228 Invalid, 0 Unknown, 745 Unchecked, 0.5s Time] [2021-12-16 06:04:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-16 06:04:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-16 06:04:01,087 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-16 06:04:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-12-16 06:04:01,088 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 54 [2021-12-16 06:04:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:01,088 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-12-16 06:04:01,088 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-16 06:04:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-12-16 06:04:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-16 06:04:01,089 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:01,089 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-16 06:04:01,107 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-16 06:04:01,303 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-16 06:04:01,303 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-16 06:04:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1199894254, now seen corresponding path program 1 times [2021-12-16 06:04:01,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:01,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875946635] [2021-12-16 06:04:01,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:01,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:04:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:01,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:04:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:01,464 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-16 06:04:01,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:01,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875946635] [2021-12-16 06:04:01,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875946635] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:01,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479397410] [2021-12-16 06:04:01,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:01,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:01,466 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-16 06:04:01,467 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-16 06:04:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:01,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-16 06:04:01,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:01,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:04:02,000 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-16 06:04:02,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:02,352 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-16 06:04:02,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479397410] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:02,352 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:02,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2021-12-16 06:04:02,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14224521] [2021-12-16 06:04:02,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:02,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-16 06:04:02,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:02,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-16 06:04:02,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2021-12-16 06:04:02,353 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 29 states, 28 states have (on average 4.392857142857143) internal successors, (123), 25 states have internal predecessors, (123), 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-16 06:04:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:02,650 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-12-16 06:04:02,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 06:04:02,650 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.392857142857143) internal successors, (123), 25 states have internal predecessors, (123), 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-16 06:04:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:02,651 INFO L225 Difference]: With dead ends: 125 [2021-12-16 06:04:02,651 INFO L226 Difference]: Without dead ends: 125 [2021-12-16 06:04:02,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2021-12-16 06:04:02,652 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 889 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:02,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [889 Valid, 516 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 06:04:02,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-16 06:04:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2021-12-16 06:04:02,653 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-16 06:04:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2021-12-16 06:04:02,654 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 57 [2021-12-16 06:04:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:02,654 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2021-12-16 06:04:02,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.392857142857143) internal successors, (123), 25 states have internal predecessors, (123), 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-16 06:04:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2021-12-16 06:04:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 06:04:02,655 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:02,655 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-16 06:04:02,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:02,859 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-16 06:04:02,859 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-16 06:04:02,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:02,860 INFO L85 PathProgramCache]: Analyzing trace with hash 963119259, now seen corresponding path program 1 times [2021-12-16 06:04:02,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:02,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786692679] [2021-12-16 06:04:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:02,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:04:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:04:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:03,336 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-16 06:04:03,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:03,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786692679] [2021-12-16 06:04:03,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786692679] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:03,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565016489] [2021-12-16 06:04:03,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:03,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:03,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:03,338 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-16 06:04:03,363 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-16 06:04:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:03,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-16 06:04:03,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:03,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:04:03,692 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:04:03,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:04:03,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:04:03,785 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:03,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2021-12-16 06:04:03,847 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:03,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-16 06:04:03,881 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:04:03,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2021-12-16 06:04:03,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:03,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-16 06:04:04,125 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:04,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-16 06:04:04,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-16 06:04:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-16 06:04:04,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:04,303 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3884 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3884) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-16 06:04:04,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3884 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_3884) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2021-12-16 06:04:04,443 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3884 (Array Int Int)) (v_ArrVal_3882 Int)) (or (= (select |c_#valid| (select (select (let ((.cse0 (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_3882))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3884)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (< |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-16 06:04:04,460 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3884 (Array Int Int)) (v_ArrVal_3882 Int)) (or (= (select |c_#valid| (select (select (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_3882))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_3884)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1) (< |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-16 06:04:04,471 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3884 (Array Int Int)) (v_ArrVal_3882 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (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_3882))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3884)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2021-12-16 06:04:04,587 INFO L354 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2021-12-16 06:04:04,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2021-12-16 06:04:04,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3884 (Array Int Int)) (v_ArrVal_3882 Int) (v_ArrVal_3879 (Array Int Int)) (v_ArrVal_3880 Int)) (or (< |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_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3879))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) v_ArrVal_3880) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3882))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3884))) |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-16 06:04:04,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3884 (Array Int Int)) (v_ArrVal_3882 Int) (v_ArrVal_3879 (Array Int Int)) (v_ArrVal_3880 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3879))) (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_3880) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3882))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3884))) |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-16 06:04:04,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_3884 (Array Int Int)) (v_ArrVal_3882 Int) (v_ArrVal_3878 (Array Int Int)) (v_ArrVal_3879 (Array Int Int)) (v_ArrVal_3880 Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3878) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3879))) (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_3880) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_29| 8) v_ArrVal_3882))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3884))) |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-16 06:04:04,655 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:04,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 66 [2021-12-16 06:04:04,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 522 treesize of output 508 [2021-12-16 06:04:04,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:04,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:04,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 382 treesize of output 358 [2021-12-16 06:04:04,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:04,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:04,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 143 [2021-12-16 06:04:04,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:04,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:04,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 218 [2021-12-16 06:04:04,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 198 [2021-12-16 06:04:04,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565016489] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:04,819 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 06:04:04,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 41 [2021-12-16 06:04:04,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954322144] [2021-12-16 06:04:04,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:04,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-16 06:04:04,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-16 06:04:04,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1928, Unknown=99, NotChecked=776, Total=2970 [2021-12-16 06:04:04,821 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 42 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 37 states have internal predecessors, (97), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 06:04:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:05,697 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2021-12-16 06:04:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-16 06:04:05,698 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 37 states have internal predecessors, (97), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2021-12-16 06:04:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:05,698 INFO L225 Difference]: With dead ends: 150 [2021-12-16 06:04:05,699 INFO L226 Difference]: Without dead ends: 150 [2021-12-16 06:04:05,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=385, Invalid=3316, Unknown=113, NotChecked=1016, Total=4830 [2021-12-16 06:04:05,700 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 349 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:05,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 1185 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 06:04:05,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-16 06:04:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 95. [2021-12-16 06:04:05,702 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-16 06:04:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-16 06:04:05,702 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 60 [2021-12-16 06:04:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:05,703 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-16 06:04:05,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 37 states have internal predecessors, (97), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-16 06:04:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-16 06:04:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 06:04:05,703 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:05,703 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-16 06:04:05,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-16 06:04:05,913 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-16 06:04:05,914 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-16 06:04:05,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:05,915 INFO L85 PathProgramCache]: Analyzing trace with hash 963119260, now seen corresponding path program 1 times [2021-12-16 06:04:05,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:05,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003337717] [2021-12-16 06:04:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:05,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:06,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:04:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:04:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-16 06:04:06,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:06,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003337717] [2021-12-16 06:04:06,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003337717] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:06,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174683663] [2021-12-16 06:04:06,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:06,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:06,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:06,467 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-16 06:04:06,468 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-16 06:04:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:06,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 97 conjunts are in the unsatisfiable core [2021-12-16 06:04:06,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:06,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:04:06,879 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:04:06,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:04:06,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:04:06,996 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:06,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-16 06:04:07,081 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:07,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-16 06:04:07,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:07,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-12-16 06:04:07,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:07,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:07,294 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:07,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2021-12-16 06:04:07,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:04:07,491 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:07,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2021-12-16 06:04:07,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:07,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-16 06:04:07,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2021-12-16 06:04:07,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-16 06:04:07,807 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-16 06:04:07,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:07,958 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:07,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2021-12-16 06:04:08,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 133 [2021-12-16 06:04:08,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2021-12-16 06:04:08,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2021-12-16 06:04:08,745 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4085 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-16 06:04:09,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4085 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (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_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) is different from false [2021-12-16 06:04:09,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4085 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (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_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-16 06:04:09,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4085 Int) (v_ArrVal_4081 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4081) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-16 06:04:09,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4085 Int) (v_ArrVal_4081 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4081) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-16 06:04:09,495 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4085 Int) (v_ArrVal_4080 (Array Int Int)) (v_ArrVal_4081 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4080) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4081) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-16 06:04:09,508 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:09,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-16 06:04:09,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 101 [2021-12-16 06:04:09,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:09,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:09,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2021-12-16 06:04:09,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:09,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:09,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2021-12-16 06:04:09,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:09,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:09,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2021-12-16 06:04:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2021-12-16 06:04:09,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174683663] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:09,991 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:09,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 72 [2021-12-16 06:04:09,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831093977] [2021-12-16 06:04:09,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:09,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2021-12-16 06:04:09,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2021-12-16 06:04:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=4215, Unknown=6, NotChecked=810, Total=5256 [2021-12-16 06:04:09,993 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 73 states, 72 states have (on average 2.236111111111111) internal successors, (161), 64 states have internal predecessors, (161), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 06:04:11,011 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_4085 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (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_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4)) .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= (select |c_#length| .cse0) 12)))) is different from false [2021-12-16 06:04:11,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse0 0)) (.cse2 (select .cse0 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_4085 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (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_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))) (= (select .cse0 4) .cse1) (= (select |c_#length| .cse2) 12) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_#res#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) 0)))) is different from false [2021-12-16 06:04:11,681 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (select .cse2 0)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_4085 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| 8) v_ArrVal_4085) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_32| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|)) (= (select .cse2 4) .cse0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select |c_#length| .cse1) 12) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-12-16 06:04:12,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:12,718 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2021-12-16 06:04:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-16 06:04:12,719 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 2.236111111111111) internal successors, (161), 64 states have internal predecessors, (161), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 60 [2021-12-16 06:04:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:12,720 INFO L225 Difference]: With dead ends: 162 [2021-12-16 06:04:12,720 INFO L226 Difference]: Without dead ends: 162 [2021-12-16 06:04:12,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 75 SyntacticMatches, 6 SemanticMatches, 92 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=424, Invalid=6741, Unknown=11, NotChecked=1566, Total=8742 [2021-12-16 06:04:12,722 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 696 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 879 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:12,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [696 Valid, 2893 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1384 Invalid, 0 Unknown, 879 Unchecked, 0.5s Time] [2021-12-16 06:04:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-16 06:04:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 94. [2021-12-16 06:04:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 90 states have internal predecessors, (95), 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-16 06:04:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-12-16 06:04:12,725 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 60 [2021-12-16 06:04:12,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:12,725 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-12-16 06:04:12,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 2.236111111111111) internal successors, (161), 64 states have internal predecessors, (161), 4 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 06:04:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-12-16 06:04:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-16 06:04:12,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:12,726 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:12,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:12,936 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-16 06:04:12,936 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-16 06:04:12,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash -258644372, now seen corresponding path program 1 times [2021-12-16 06:04:12,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:12,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463251653] [2021-12-16 06:04:12,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:12,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:04:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:12,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:04:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 06:04:12,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463251653] [2021-12-16 06:04:12,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463251653] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929293182] [2021-12-16 06:04:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:12,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:12,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:13,003 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:13,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-16 06:04:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:13,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 06:04:13,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 06:04:13,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 06:04:13,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929293182] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:13,370 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:13,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-16 06:04:13,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5615184] [2021-12-16 06:04:13,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:13,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-16 06:04:13,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:13,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 06:04:13,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 06:04:13,371 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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-16 06:04:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:13,428 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-12-16 06:04:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 06:04:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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 61 [2021-12-16 06:04:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:13,429 INFO L225 Difference]: With dead ends: 94 [2021-12-16 06:04:13,429 INFO L226 Difference]: Without dead ends: 94 [2021-12-16 06:04:13,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:04:13,430 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 63 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:13,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 294 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-16 06:04:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-16 06:04:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 90 states have internal predecessors, (94), 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-16 06:04:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-12-16 06:04:13,432 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 61 [2021-12-16 06:04:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:13,432 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-12-16 06:04:13,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 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-16 06:04:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-12-16 06:04:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-16 06:04:13,433 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:13,433 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:13,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-16 06:04:13,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:13,639 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-16 06:04:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1906011450, now seen corresponding path program 2 times [2021-12-16 06:04:13,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:13,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405337762] [2021-12-16 06:04:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:13,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:13,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:04:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:13,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:04:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-16 06:04:13,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:13,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405337762] [2021-12-16 06:04:13,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405337762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:13,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889073342] [2021-12-16 06:04:13,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 06:04:13,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:13,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:13,703 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:13,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-16 06:04:14,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 06:04:14,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 06:04:14,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 06:04:14,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 06:04:14,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-16 06:04:14,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889073342] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:14,231 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:14,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-16 06:04:14,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688187112] [2021-12-16 06:04:14,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:14,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 06:04:14,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:14,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 06:04:14,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-16 06:04:14,233 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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-16 06:04:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 06:04:14,315 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2021-12-16 06:04:14,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-16 06:04:14,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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 63 [2021-12-16 06:04:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 06:04:14,316 INFO L225 Difference]: With dead ends: 85 [2021-12-16 06:04:14,316 INFO L226 Difference]: Without dead ends: 85 [2021-12-16 06:04:14,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-16 06:04:14,317 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 06:04:14,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 256 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 06:04:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-16 06:04:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-16 06:04:14,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 81 states have internal predecessors, (83), 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-16 06:04:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2021-12-16 06:04:14,319 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 63 [2021-12-16 06:04:14,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 06:04:14,319 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2021-12-16 06:04:14,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 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-16 06:04:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2021-12-16 06:04:14,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-12-16 06:04:14,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 06:04:14,320 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 06:04:14,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-16 06:04:14,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:14,531 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-16 06:04:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 06:04:14,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1093757523, now seen corresponding path program 1 times [2021-12-16 06:04:14,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 06:04:14,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355463036] [2021-12-16 06:04:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:14,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 06:04:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:15,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-16 06:04:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-16 06:04:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-16 06:04:15,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 06:04:15,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355463036] [2021-12-16 06:04:15,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355463036] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 06:04:15,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595229704] [2021-12-16 06:04:15,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 06:04:15,340 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 06:04:15,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 06:04:15,342 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 06:04:15,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-16 06:04:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 06:04:15,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 111 conjunts are in the unsatisfiable core [2021-12-16 06:04:15,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 06:04:15,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:04:15,828 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 06:04:15,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-16 06:04:15,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-16 06:04:15,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-16 06:04:16,001 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:16,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-16 06:04:16,035 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-16 06:04:16,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2021-12-16 06:04:16,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-16 06:04:16,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 06:04:16,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-16 06:04:16,372 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 06:04:16,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 53 [2021-12-16 06:04:16,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-16 06:04:16,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-16 06:04:16,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-16 06:04:16,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-16 06:04:16,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 06:04:16,754 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 06:04:16,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 06:04:17,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2021-12-16 06:04:17,071 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_main_~len~0#1| 1) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (forall ((v_ArrVal_4678 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4678) |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|)) (forall ((v_ArrVal_4677 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4677) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) is different from false [2021-12-16 06:04:17,085 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4677 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4677) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset|)) (= (+ |c_ULTIMATE.start_main_~len~0#1| 1) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (forall ((v_ArrVal_4678 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4678) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|))) is different from false [2021-12-16 06:04:17,093 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_main_~len~0#1| 1) |c_ULTIMATE.start_dll_circular_update_at_~data#1|) (forall ((v_ArrVal_4678 (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_4678) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (forall ((v_ArrVal_4677 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_4677) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)))) is different from false [2021-12-16 06:04:17,106 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4678 (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_4678) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (forall ((v_ArrVal_4677 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4677) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= 1 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-16 06:04:17,145 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4678 (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_4678) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (forall ((v_ArrVal_4677 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4677) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-16 06:04:17,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214 [2021-12-16 06:04:17,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2021-12-16 06:04:17,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 162 [2021-12-16 06:04:17,237 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_4673 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| 8) v_ArrVal_4673)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (and (or .cse0 (not (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|))) .cse0 (forall ((v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 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|) (+ |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| 8) v_ArrVal_4673)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_4678) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-16 06:04:17,249 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4673 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| 8) v_ArrVal_4673)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int)) (let ((.cse0 (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|) (+ |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset| 8) v_ArrVal_4673)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_4678) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-16 06:04:19,281 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (and (forall ((v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int)) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_4678) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) (forall ((v_ArrVal_4673 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-16 06:04:21,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (and (forall ((v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int)) (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_38| 8) v_ArrVal_4673))) (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_4678) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) .cse1)))) (forall ((v_ArrVal_4673 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (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_38| 8) v_ArrVal_4673) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))))))) is different from false [2021-12-16 06:04:23,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int)) (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_38| 8) v_ArrVal_4673))) (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_4678) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse1)))) (forall ((v_ArrVal_4673 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (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_38| 8) v_ArrVal_4673) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2021-12-16 06:04:25,349 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (and (forall ((v_ArrVal_4673 Int) (v_ArrVal_4672 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (store (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| 4) v_ArrVal_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int) (v_ArrVal_4672 Int)) (let ((.cse0 (store (store (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| 4) v_ArrVal_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673))) (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_4678) |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_38| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2021-12-16 06:04:25,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_4670 (Array Int Int)) (v_ArrVal_4673 Int) (v_ArrVal_4672 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4670) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) v_ArrVal_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_4670 (Array Int Int)) (v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int) (v_ArrVal_4672 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4670))) (let ((.cse1 (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) v_ArrVal_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673))) (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_4678) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse2)))))))) is different from false [2021-12-16 06:04:25,427 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_4670 (Array Int Int)) (v_ArrVal_4673 Int) (v_ArrVal_4672 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4670) |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_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_4670 (Array Int Int)) (v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int) (v_ArrVal_4672 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4670))) (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_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673))) (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_4678) |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-16 06:04:25,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (and (forall ((v_ArrVal_4670 (Array Int Int)) (v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int) (v_ArrVal_4669 (Array Int Int)) (v_ArrVal_4672 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4669) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4670))) (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_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673))) (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_4678) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_4670 (Array Int Int)) (v_ArrVal_4673 Int) (v_ArrVal_4669 (Array Int Int)) (v_ArrVal_4672 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_4669) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_4670) |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_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2021-12-16 06:04:25,494 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-16 06:04:25,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 111 [2021-12-16 06:04:25,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 331 [2021-12-16 06:04:25,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 229 [2021-12-16 06:04:25,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 200 [2021-12-16 06:04:25,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 152 [2021-12-16 06:04:25,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 140 [2021-12-16 06:04:25,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 06:04:25,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2021-12-16 06:04:25,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2021-12-16 06:04:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-16 06:04:25,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595229704] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 06:04:25,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 06:04:25,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 34] total 85 [2021-12-16 06:04:25,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075648066] [2021-12-16 06:04:25,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 06:04:25,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2021-12-16 06:04:25,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 06:04:25,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2021-12-16 06:04:25,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4776, Unknown=14, NotChecked=2114, Total=7140 [2021-12-16 06:04:25,937 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 85 states, 85 states have (on average 1.8705882352941177) internal successors, (159), 76 states have internal predecessors, (159), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-16 06:04:28,589 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse1 (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|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| Int)) (or (and (forall ((v_ArrVal_4673 Int) (v_ArrVal_4672 Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (store (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| 4) v_ArrVal_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_4678 (Array Int Int)) (v_ArrVal_4673 Int) (v_ArrVal_4672 Int)) (let ((.cse2 (store (store (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| 4) v_ArrVal_4672) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| 8) v_ArrVal_4673))) (let ((.cse3 (select .cse2 |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| .cse2) .cse3 v_ArrVal_4678) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) .cse3))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_38| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false