./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 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/forester-heap/sll-rb-cnstr_1-1.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 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:05:28,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:05:28,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:05:28,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:05:28,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:05:28,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:05:28,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:05:28,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:05:28,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:05:28,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:05:28,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:05:28,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:05:28,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:05:28,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:05:28,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:05:28,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:05:28,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:05:28,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:05:28,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:05:28,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:05:28,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:05:28,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:05:28,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:05:28,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:05:28,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:05:28,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:05:28,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:05:28,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:05:28,369 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:05:28,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:05:28,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:05:28,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:05:28,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:05:28,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:05:28,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:05:28,374 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:05:28,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:05:28,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:05:28,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:05:28,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:05:28,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:05:28,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-15 14:05:28,406 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:05:28,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:05:28,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:05:28,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:05:28,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:05:28,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:05:28,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:05:28,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:05:28,409 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:05:28,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:05:28,410 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:05:28,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:05:28,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:05:28,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:05:28,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:05:28,411 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:05:28,411 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:05:28,411 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:05:28,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:05:28,412 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:05:28,412 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:05:28,412 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:05:28,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:05:28,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:05:28,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:05:28,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:05:28,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:05:28,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:05:28,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:05:28,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:05:28,415 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:05:28,415 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 -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2021-12-15 14:05:28,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:05:28,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:05:28,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:05:28,661 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:05:28,662 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:05:28,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-15 14:05:28,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3ea7128/6cff7fe03e8c4f24a43eecd2dba9dc1f/FLAGf35da290c [2021-12-15 14:05:29,147 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:05:29,148 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-15 14:05:29,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3ea7128/6cff7fe03e8c4f24a43eecd2dba9dc1f/FLAGf35da290c [2021-12-15 14:05:29,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3ea7128/6cff7fe03e8c4f24a43eecd2dba9dc1f [2021-12-15 14:05:29,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:05:29,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:05:29,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:05:29,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:05:29,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:05:29,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5552e3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29, skipping insertion in model container [2021-12-15 14:05:29,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:05:29,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:05:29,802 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/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-15 14:05:29,804 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/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-15 14:05:29,805 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/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-15 14:05:29,806 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/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-15 14:05:29,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:05:29,816 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:05:29,845 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/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-15 14:05:29,846 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/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-15 14:05:29,847 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/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-15 14:05:29,847 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/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-15 14:05:29,850 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:05:29,872 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:05:29,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29 WrapperNode [2021-12-15 14:05:29,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:05:29,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:05:29,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:05:29,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:05:29,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,932 INFO L137 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2021-12-15 14:05:29,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:05:29,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:05:29,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:05:29,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:05:29,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:29,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:05:29,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:05:29,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:05:29,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:05:29,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (1/1) ... [2021-12-15 14:05:30,004 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:05:30,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:30,031 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-15 14:05:30,038 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-15 14:05:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 14:05:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 14:05:30,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:05:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:05:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:05:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:05:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:05:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:05:30,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:05:30,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:05:30,174 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:05:30,176 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:05:30,437 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:05:30,444 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:05:30,444 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-15 14:05:30,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:05:30 BoogieIcfgContainer [2021-12-15 14:05:30,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:05:30,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:05:30,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:05:30,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:05:30,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:05:29" (1/3) ... [2021-12-15 14:05:30,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b879d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:05:30, skipping insertion in model container [2021-12-15 14:05:30,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:05:29" (2/3) ... [2021-12-15 14:05:30,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b879d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:05:30, skipping insertion in model container [2021-12-15 14:05:30,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:05:30" (3/3) ... [2021-12-15 14:05:30,451 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2021-12-15 14:05:30,455 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:05:30,455 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-12-15 14:05:30,486 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:05:30,492 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-15 14:05:30,492 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-12-15 14:05:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 120 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:05:30,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:30,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:05:30,511 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:30,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:05:30,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:30,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240588520] [2021-12-15 14:05:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:30,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:30,662 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-15 14:05:30,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:30,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240588520] [2021-12-15 14:05:30,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240588520] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:30,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:30,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:05:30,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022670151] [2021-12-15 14:05:30,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:30,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:05:30,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:30,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:05:30,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:05:30,703 INFO L87 Difference]: Start difference. First operand has 121 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 120 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:30,858 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-15 14:05:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:05:30,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:05:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:30,869 INFO L225 Difference]: With dead ends: 123 [2021-12-15 14:05:30,869 INFO L226 Difference]: Without dead ends: 119 [2021-12-15 14:05:30,871 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-15 14:05:30,875 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:30,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 75 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-15 14:05:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-15 14:05:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 114 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2021-12-15 14:05:30,913 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 3 [2021-12-15 14:05:30,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:30,914 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2021-12-15 14:05:30,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:30,914 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2021-12-15 14:05:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:05:30,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:30,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:05:30,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:05:30,916 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:30,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:05:30,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:30,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845163471] [2021-12-15 14:05:30,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:30,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:30,964 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-15 14:05:30,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:30,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845163471] [2021-12-15 14:05:30,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845163471] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:30,965 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:30,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:05:30,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190884661] [2021-12-15 14:05:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:30,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:05:30,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:05:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:05:30,968 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:31,077 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-15 14:05:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:05:31,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-15 14:05:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:31,083 INFO L225 Difference]: With dead ends: 133 [2021-12-15 14:05:31,084 INFO L226 Difference]: Without dead ends: 133 [2021-12-15 14:05:31,084 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-15 14:05:31,085 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:31,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 80 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-15 14:05:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2021-12-15 14:05:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2021-12-15 14:05:31,097 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 3 [2021-12-15 14:05:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:31,097 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2021-12-15 14:05:31,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,098 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2021-12-15 14:05:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 14:05:31,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:31,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:31,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:05:31,102 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-15 14:05:31,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:31,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593073736] [2021-12-15 14:05:31,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:31,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:31,204 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-15 14:05:31,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:31,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593073736] [2021-12-15 14:05:31,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593073736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:31,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:31,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:05:31,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743029582] [2021-12-15 14:05:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:31,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:05:31,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:31,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:05:31,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:05:31,207 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:31,332 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-12-15 14:05:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:05:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-15 14:05:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:31,336 INFO L225 Difference]: With dead ends: 125 [2021-12-15 14:05:31,336 INFO L226 Difference]: Without dead ends: 125 [2021-12-15 14:05:31,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:31,341 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 158 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:31,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 63 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-15 14:05:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2021-12-15 14:05:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2021-12-15 14:05:31,361 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 8 [2021-12-15 14:05:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:31,362 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2021-12-15 14:05:31,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2021-12-15 14:05:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 14:05:31,364 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:31,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:31,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:05:31,366 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-15 14:05:31,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:31,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662564510] [2021-12-15 14:05:31,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:31,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:31,484 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-15 14:05:31,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:31,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662564510] [2021-12-15 14:05:31,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662564510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:31,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:31,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:05:31,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558650774] [2021-12-15 14:05:31,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:31,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:31,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:31,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:31,487 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:31,682 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2021-12-15 14:05:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:05:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-15 14:05:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:31,683 INFO L225 Difference]: With dead ends: 145 [2021-12-15 14:05:31,683 INFO L226 Difference]: Without dead ends: 145 [2021-12-15 14:05:31,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:05:31,685 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 249 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:31,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 102 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:05:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-15 14:05:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2021-12-15 14:05:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-12-15 14:05:31,690 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 8 [2021-12-15 14:05:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:31,690 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-12-15 14:05:31,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-12-15 14:05:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:05:31,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:31,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:31,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:05:31,693 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:31,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1117785369, now seen corresponding path program 1 times [2021-12-15 14:05:31,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:31,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219066566] [2021-12-15 14:05:31,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:31,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:31,729 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-15 14:05:31,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:31,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219066566] [2021-12-15 14:05:31,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219066566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:31,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:31,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:05:31,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205591729] [2021-12-15 14:05:31,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:31,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:05:31,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:31,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:05:31,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:05:31,732 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:31,828 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2021-12-15 14:05:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:05:31,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-15 14:05:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:31,829 INFO L225 Difference]: With dead ends: 130 [2021-12-15 14:05:31,829 INFO L226 Difference]: Without dead ends: 130 [2021-12-15 14:05:31,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:31,831 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 111 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:31,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 133 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-15 14:05:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2021-12-15 14:05:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-12-15 14:05:31,836 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 10 [2021-12-15 14:05:31,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:31,837 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-12-15 14:05:31,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-12-15 14:05:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:05:31,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:31,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:31,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:05:31,838 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:31,839 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-15 14:05:31,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:31,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515192930] [2021-12-15 14:05:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:31,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:31,887 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-15 14:05:31,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515192930] [2021-12-15 14:05:31,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515192930] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:31,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:31,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:05:31,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563844189] [2021-12-15 14:05:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:31,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:31,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:31,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:31,890 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:32,048 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2021-12-15 14:05:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 14:05:32,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 14:05:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:32,049 INFO L225 Difference]: With dead ends: 116 [2021-12-15 14:05:32,049 INFO L226 Difference]: Without dead ends: 116 [2021-12-15 14:05:32,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:05:32,050 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:32,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 249 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-15 14:05:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-12-15 14:05:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 114 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-12-15 14:05:32,055 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 12 [2021-12-15 14:05:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:32,056 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-12-15 14:05:32,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-12-15 14:05:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:05:32,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:32,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:32,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:05:32,057 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:32,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-15 14:05:32,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:32,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475064258] [2021-12-15 14:05:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:32,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:32,148 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-15 14:05:32,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:32,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475064258] [2021-12-15 14:05:32,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475064258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:32,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:32,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:05:32,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122849263] [2021-12-15 14:05:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:32,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:32,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:32,151 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:32,338 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-12-15 14:05:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:05:32,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 14:05:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:32,339 INFO L225 Difference]: With dead ends: 117 [2021-12-15 14:05:32,339 INFO L226 Difference]: Without dead ends: 117 [2021-12-15 14:05:32,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:05:32,340 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:32,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 284 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-15 14:05:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2021-12-15 14:05:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 109 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-12-15 14:05:32,345 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 12 [2021-12-15 14:05:32,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:32,345 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-12-15 14:05:32,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-12-15 14:05:32,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 14:05:32,346 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:32,346 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:32,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:05:32,346 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:32,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1066467192, now seen corresponding path program 1 times [2021-12-15 14:05:32,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:32,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118452450] [2021-12-15 14:05:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:32,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:32,402 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-15 14:05:32,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:32,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118452450] [2021-12-15 14:05:32,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118452450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:32,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:32,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:05:32,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654959048] [2021-12-15 14:05:32,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:32,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:32,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:32,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:32,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:32,404 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:32,534 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2021-12-15 14:05:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:05:32,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-15 14:05:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:32,536 INFO L225 Difference]: With dead ends: 167 [2021-12-15 14:05:32,536 INFO L226 Difference]: Without dead ends: 167 [2021-12-15 14:05:32,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:05:32,537 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 205 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:32,537 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 227 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-15 14:05:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2021-12-15 14:05:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.4) internal successors, (126), 116 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2021-12-15 14:05:32,541 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 13 [2021-12-15 14:05:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:32,541 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2021-12-15 14:05:32,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,542 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2021-12-15 14:05:32,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:05:32,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:32,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:32,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:05:32,543 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1434903386, now seen corresponding path program 1 times [2021-12-15 14:05:32,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:32,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298037715] [2021-12-15 14:05:32,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:32,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:32,614 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-15 14:05:32,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298037715] [2021-12-15 14:05:32,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298037715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:32,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:32,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:05:32,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54079848] [2021-12-15 14:05:32,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:32,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:05:32,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:32,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:05:32,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:32,616 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:32,701 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2021-12-15 14:05:32,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:05:32,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 14:05:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:32,702 INFO L225 Difference]: With dead ends: 121 [2021-12-15 14:05:32,702 INFO L226 Difference]: Without dead ends: 121 [2021-12-15 14:05:32,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-15 14:05:32,703 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:32,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-15 14:05:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2021-12-15 14:05:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-12-15 14:05:32,717 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 20 [2021-12-15 14:05:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:32,717 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-12-15 14:05:32,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-12-15 14:05:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:05:32,718 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:32,718 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:32,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:05:32,719 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1476921639, now seen corresponding path program 1 times [2021-12-15 14:05:32,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:32,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959876176] [2021-12-15 14:05:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:32,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:32,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:32,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959876176] [2021-12-15 14:05:32,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959876176] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:32,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275407354] [2021-12-15 14:05:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:32,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:32,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:32,795 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-15 14:05:32,822 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-15 14:05:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:32,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-15 14:05:32,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:32,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:32,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:33,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:33,030 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-15 14:05:33,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:33,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, 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-15 14:05:33,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:33,154 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 15 treesize of output 7 [2021-12-15 14:05:33,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:33,162 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:33,162 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 15 treesize of output 10 [2021-12-15 14:05:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:33,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:33,523 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 21 treesize of output 19 [2021-12-15 14:05:33,526 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 17 [2021-12-15 14:05:33,531 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 23 treesize of output 21 [2021-12-15 14:05:33,536 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-15 14:05:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:33,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275407354] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:33,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:33,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-15 14:05:33,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476140532] [2021-12-15 14:05:33,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:33,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:05:33,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:33,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:05:33,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:05:33,558 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:33,859 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-12-15 14:05:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 14:05:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-15 14:05:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:33,861 INFO L225 Difference]: With dead ends: 143 [2021-12-15 14:05:33,861 INFO L226 Difference]: Without dead ends: 143 [2021-12-15 14:05:33,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-15 14:05:33,862 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 162 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:33,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 453 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2021-12-15 14:05:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-15 14:05:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2021-12-15 14:05:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2021-12-15 14:05:33,865 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2021-12-15 14:05:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:33,865 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2021-12-15 14:05:33,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2021-12-15 14:05:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:05:33,867 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:33,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:33,896 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-15 14:05:34,067 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,SelfDestructingSolverStorable9 [2021-12-15 14:05:34,068 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1060451530, now seen corresponding path program 1 times [2021-12-15 14:05:34,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:34,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844312693] [2021-12-15 14:05:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:34,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:34,142 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-15 14:05:34,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:34,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844312693] [2021-12-15 14:05:34,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844312693] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:34,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:34,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:05:34,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019143361] [2021-12-15 14:05:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:34,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:34,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:34,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:34,145 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:34,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:34,291 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2021-12-15 14:05:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:05:34,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:05:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:34,292 INFO L225 Difference]: With dead ends: 123 [2021-12-15 14:05:34,292 INFO L226 Difference]: Without dead ends: 123 [2021-12-15 14:05:34,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:05:34,293 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:34,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 246 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-15 14:05:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2021-12-15 14:05:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 121 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2021-12-15 14:05:34,296 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 21 [2021-12-15 14:05:34,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:34,297 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2021-12-15 14:05:34,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2021-12-15 14:05:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:05:34,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:34,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:34,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:05:34,298 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1060451529, now seen corresponding path program 1 times [2021-12-15 14:05:34,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:34,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672664339] [2021-12-15 14:05:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:34,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:34,358 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-15 14:05:34,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:34,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672664339] [2021-12-15 14:05:34,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672664339] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:34,359 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:34,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:05:34,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242038017] [2021-12-15 14:05:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:34,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:34,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:34,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:34,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:34,361 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:34,492 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2021-12-15 14:05:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:05:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 14:05:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:34,493 INFO L225 Difference]: With dead ends: 120 [2021-12-15 14:05:34,493 INFO L226 Difference]: Without dead ends: 120 [2021-12-15 14:05:34,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:05:34,494 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 9 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:34,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 292 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:05:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-15 14:05:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2021-12-15 14:05:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-15 14:05:34,497 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 21 [2021-12-15 14:05:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:34,498 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-15 14:05:34,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-15 14:05:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:05:34,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:34,499 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:34,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:05:34,499 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:34,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:34,499 INFO L85 PathProgramCache]: Analyzing trace with hash -794042809, now seen corresponding path program 1 times [2021-12-15 14:05:34,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:34,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526810052] [2021-12-15 14:05:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:34,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:34,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:34,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526810052] [2021-12-15 14:05:34,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526810052] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:34,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524636160] [2021-12-15 14:05:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:34,746 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:34,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:34,747 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-15 14:05:34,748 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-15 14:05:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:34,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-15 14:05:34,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:34,836 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-15 14:05:34,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 14:05:34,917 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:34,917 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-15 14:05:34,955 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-15 14:05:34,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:34,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:05:35,020 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-15 14:05:35,053 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-15 14:05:35,082 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-15 14:05:35,120 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-15 14:05:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:35,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:35,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:35,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:35,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:35,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_316 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_316)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:35,272 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_7| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_57| Int) (v_ArrVal_316 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_57| v_ArrVal_316)) |v_ULTIMATE.start_main_#t~malloc3#1.base_7| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_57|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_7|))))) is different from false [2021-12-15 14:05:35,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:35,291 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:35,292 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2021-12-15 14:05:35,295 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 36 treesize of output 24 [2021-12-15 14:05:35,298 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 7 treesize of output 3 [2021-12-15 14:05:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:35,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524636160] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:35,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:35,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2021-12-15 14:05:35,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153956260] [2021-12-15 14:05:35,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:35,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 14:05:35,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:35,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 14:05:35,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=302, Unknown=5, NotChecked=200, Total=600 [2021-12-15 14:05:35,332 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:35,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:35,874 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2021-12-15 14:05:35,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 14:05:35,875 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:05:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:35,877 INFO L225 Difference]: With dead ends: 255 [2021-12-15 14:05:35,877 INFO L226 Difference]: Without dead ends: 255 [2021-12-15 14:05:35,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=622, Unknown=5, NotChecked=290, Total=1122 [2021-12-15 14:05:35,878 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 336 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:35,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 536 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 591 Invalid, 0 Unknown, 682 Unchecked, 0.3s Time] [2021-12-15 14:05:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-12-15 14:05:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 128. [2021-12-15 14:05:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 127 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2021-12-15 14:05:35,884 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 23 [2021-12-15 14:05:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:35,884 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2021-12-15 14:05:35,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2021-12-15 14:05:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 14:05:35,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:35,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:35,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:36,099 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,SelfDestructingSolverStorable12 [2021-12-15 14:05:36,100 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash -136678670, now seen corresponding path program 1 times [2021-12-15 14:05:36,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:36,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406670467] [2021-12-15 14:05:36,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:36,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:05:36,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:36,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406670467] [2021-12-15 14:05:36,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406670467] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:36,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:36,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:05:36,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535874267] [2021-12-15 14:05:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:36,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:05:36,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:05:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:05:36,127 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:36,158 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2021-12-15 14:05:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:05:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 14:05:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:36,160 INFO L225 Difference]: With dead ends: 130 [2021-12-15 14:05:36,160 INFO L226 Difference]: Without dead ends: 130 [2021-12-15 14:05:36,160 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-15 14:05:36,161 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:36,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:05:36,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-15 14:05:36,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-15 14:05:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.287037037037037) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2021-12-15 14:05:36,164 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 26 [2021-12-15 14:05:36,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:36,164 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2021-12-15 14:05:36,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2021-12-15 14:05:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 14:05:36,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:36,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:36,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:05:36,165 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:36,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:36,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1795791349, now seen corresponding path program 1 times [2021-12-15 14:05:36,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:36,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853779099] [2021-12-15 14:05:36,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:36,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:05:36,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:36,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853779099] [2021-12-15 14:05:36,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853779099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:36,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:36,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:05:36,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871627472] [2021-12-15 14:05:36,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:36,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:05:36,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:36,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:05:36,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:05:36,233 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:36,289 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2021-12-15 14:05:36,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:05:36,290 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 14:05:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:36,290 INFO L225 Difference]: With dead ends: 138 [2021-12-15 14:05:36,290 INFO L226 Difference]: Without dead ends: 138 [2021-12-15 14:05:36,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:36,291 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:36,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 211 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:05:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-15 14:05:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2021-12-15 14:05:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2021-12-15 14:05:36,294 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 28 [2021-12-15 14:05:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:36,294 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2021-12-15 14:05:36,295 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2021-12-15 14:05:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 14:05:36,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:36,295 INFO L514 BasicCegarLoop]: trace histogram [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-15 14:05:36,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:05:36,295 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:36,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:36,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1776841875, now seen corresponding path program 1 times [2021-12-15 14:05:36,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:36,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867044940] [2021-12-15 14:05:36,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:36,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:36,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:36,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:36,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867044940] [2021-12-15 14:05:36,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867044940] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:36,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781936034] [2021-12-15 14:05:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:36,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:36,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:36,423 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-15 14:05:36,429 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-15 14:05:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:36,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-15 14:05:36,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:36,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:36,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:36,566 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-15 14:05:36,567 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 21 treesize of output 20 [2021-12-15 14:05:36,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:36,571 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-15 14:05:36,652 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-15 14:05:36,659 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-15 14:05:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:05:36,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:05:36,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781936034] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:36,807 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:36,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2021-12-15 14:05:36,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539283902] [2021-12-15 14:05:36,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:36,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:05:36,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:36,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:05:36,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:05:36,809 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:37,162 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2021-12-15 14:05:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:05:37,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 14:05:37,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:37,164 INFO L225 Difference]: With dead ends: 180 [2021-12-15 14:05:37,164 INFO L226 Difference]: Without dead ends: 180 [2021-12-15 14:05:37,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-12-15 14:05:37,165 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 78 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:37,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 387 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:05:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-15 14:05:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2021-12-15 14:05:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 143 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2021-12-15 14:05:37,168 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 29 [2021-12-15 14:05:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:37,169 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2021-12-15 14:05:37,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2021-12-15 14:05:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 14:05:37,169 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:37,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:37,196 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-15 14:05:37,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:37,380 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash 752476291, now seen corresponding path program 1 times [2021-12-15 14:05:37,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:37,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946982324] [2021-12-15 14:05:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:37,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:05:37,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:37,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946982324] [2021-12-15 14:05:37,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946982324] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:37,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568270729] [2021-12-15 14:05:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:37,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:37,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:37,446 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-15 14:05:37,479 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-15 14:05:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:37,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 14:05:37,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:37,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 15 treesize of output 5 [2021-12-15 14:05:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:05:37,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 14:05:37,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568270729] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:37,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:37,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-15 14:05:37,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32683941] [2021-12-15 14:05:37,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:37,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:05:37,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:37,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:05:37,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:05:37,822 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:37,896 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2021-12-15 14:05:37,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:05:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 14:05:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:37,898 INFO L225 Difference]: With dead ends: 152 [2021-12-15 14:05:37,898 INFO L226 Difference]: Without dead ends: 129 [2021-12-15 14:05:37,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:37,899 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:37,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2021-12-15 14:05:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-15 14:05:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-15 14:05:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2021-12-15 14:05:37,902 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 30 [2021-12-15 14:05:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:37,902 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2021-12-15 14:05:37,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2021-12-15 14:05:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 14:05:37,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:37,902 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:37,928 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-15 14:05:38,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-15 14:05:38,124 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:38,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2041230200, now seen corresponding path program 1 times [2021-12-15 14:05:38,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:38,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889485647] [2021-12-15 14:05:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:38,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:38,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:38,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889485647] [2021-12-15 14:05:38,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889485647] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:38,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547261189] [2021-12-15 14:05:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:38,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:38,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:38,257 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-15 14:05:38,284 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-15 14:05:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:38,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-15 14:05:38,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:38,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 14:05:38,425 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:05:38,426 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-15 14:05:38,464 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-15 14:05:38,604 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:38,604 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 29 [2021-12-15 14:05:38,671 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:38,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-15 14:05:38,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:38,830 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 25 treesize of output 13 [2021-12-15 14:05:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:38,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:39,220 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:39,220 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 20 treesize of output 21 [2021-12-15 14:05:39,230 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:39,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-15 14:05: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 11 treesize of output 9 [2021-12-15 14:05:40,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:40,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547261189] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:40,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:40,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-15 14:05:40,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316613917] [2021-12-15 14:05:40,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:40,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-15 14:05:40,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-15 14:05:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=733, Unknown=8, NotChecked=0, Total=870 [2021-12-15 14:05:40,297 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:40,776 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2021-12-15 14:05:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 14:05:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 14:05:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:40,778 INFO L225 Difference]: With dead ends: 199 [2021-12-15 14:05:40,778 INFO L226 Difference]: Without dead ends: 199 [2021-12-15 14:05:40,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=1080, Unknown=8, NotChecked=0, Total=1332 [2021-12-15 14:05:40,779 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 418 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:40,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 520 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 510 Invalid, 0 Unknown, 701 Unchecked, 0.3s Time] [2021-12-15 14:05:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-15 14:05:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 137. [2021-12-15 14:05:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2021-12-15 14:05:40,782 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 30 [2021-12-15 14:05:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:40,783 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2021-12-15 14:05:40,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2021-12-15 14:05:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 14:05:40,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:40,783 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:40,805 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-15 14:05:40,984 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,SelfDestructingSolverStorable17 [2021-12-15 14:05:40,984 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:40,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2041230201, now seen corresponding path program 1 times [2021-12-15 14:05:40,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:40,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938522299] [2021-12-15 14:05:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:40,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:41,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938522299] [2021-12-15 14:05:41,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938522299] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809160316] [2021-12-15 14:05:41,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:41,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:41,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:41,152 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-15 14:05:41,180 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-15 14:05:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:41,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-15 14:05:41,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:41,249 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-15 14:05:41,315 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-15 14:05:41,331 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:41,333 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-15 14:05:41,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:41,376 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-15 14:05:41,506 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:41,507 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 29 [2021-12-15 14:05:41,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:41,520 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-15 14:05:41,577 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:41,577 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-15 14:05:41,580 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-15 14:05:41,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:41,752 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 15 treesize of output 7 [2021-12-15 14:05:41,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:41,757 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:41,757 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 25 treesize of output 16 [2021-12-15 14:05:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:41,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:42,361 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:42,362 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 58 treesize of output 51 [2021-12-15 14:05:42,367 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:42,367 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 51 treesize of output 51 [2021-12-15 14:05:42,374 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:42,375 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 74 treesize of output 77 [2021-12-15 14:05:42,383 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:42,383 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 125 treesize of output 120 [2021-12-15 14:05:42,389 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 89 treesize of output 85 [2021-12-15 14:05:42,393 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 85 treesize of output 81 [2021-12-15 14:05:42,397 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 81 treesize of output 79 [2021-12-15 14:05:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:42,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809160316] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:42,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:42,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-15 14:05:42,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121826862] [2021-12-15 14:05:42,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:42,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-15 14:05:42,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:42,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-15 14:05:42,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=763, Unknown=10, NotChecked=0, Total=870 [2021-12-15 14:05:42,833 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:44,482 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (select .cse6 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~end~0#1.offset|) (<= 0 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 4)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_74| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_74| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|))) (and (<= (+ .cse1 8) (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|))) (<= 0 (+ .cse1 4)))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_74|))) (= (select .cse2 0) 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_main_~end~0#1.offset|) 0) (<= 8 (select |c_#length| .cse0)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| .cse3)) (<= 8 (select |c_#length| .cse3)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) (<= (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8) (select |c_#length| |c_ULTIMATE.start_main_~end~0#1.base|)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_14| Int)) (or (let ((.cse4 (< |c_ULTIMATE.start_main_~list~0#1.offset| 0))) (and (or .cse4 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (or .cse4 (<= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~end~0#1.offset|)) (or .cse4 (<= |c_ULTIMATE.start_main_~end~0#1.offset| 0)) (or .cse4 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_14|))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_14|))))) (<= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_74| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_74| 0) (and (forall ((v_ArrVal_569 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_569) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|) 4))) (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_569) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_570) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|)))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_74|)))))) is different from false [2021-12-15 14:05:45,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:45,077 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2021-12-15 14:05:45,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-15 14:05:45,078 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 14:05:45,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:45,078 INFO L225 Difference]: With dead ends: 185 [2021-12-15 14:05:45,078 INFO L226 Difference]: Without dead ends: 185 [2021-12-15 14:05:45,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=296, Invalid=1953, Unknown=11, NotChecked=92, Total=2352 [2021-12-15 14:05:45,080 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 198 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:45,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 951 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1088 Invalid, 0 Unknown, 543 Unchecked, 0.6s Time] [2021-12-15 14:05:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-15 14:05:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 140. [2021-12-15 14:05:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 139 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2021-12-15 14:05:45,083 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 30 [2021-12-15 14:05:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:45,083 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2021-12-15 14:05:45,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2021-12-15 14:05:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-15 14:05:45,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:45,084 INFO L514 BasicCegarLoop]: trace histogram [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-15 14:05:45,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:45,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:45,304 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash -862773577, now seen corresponding path program 1 times [2021-12-15 14:05:45,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:45,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128366944] [2021-12-15 14:05:45,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:45,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:45,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:45,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128366944] [2021-12-15 14:05:45,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128366944] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:45,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558888366] [2021-12-15 14:05:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:45,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:45,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:45,637 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-15 14:05:45,638 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-15 14:05:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:45,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 14:05:45,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:45,741 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-15 14:05:45,757 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-15 14:05:45,807 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:45,807 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-15 14:05:45,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:45,828 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-15 14:05:45,834 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-15 14:05:45,880 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-15 14:05:45,911 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-15 14:05:45,938 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-15 14:05:45,957 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:45,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 14:05:45,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:45,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:05:46,012 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 16 treesize of output 8 [2021-12-15 14:05:46,041 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-15 14:05:46,049 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-15 14:05:46,080 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-15 14:05:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:46,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:46,125 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:46,133 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:46,138 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:46,146 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_692 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:46,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_692 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_11|))))) is different from false [2021-12-15 14:05:46,300 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:46,301 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 13 treesize of output 12 [2021-12-15 14:05:46,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_692 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_682)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_11| |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2021-12-15 14:05:46,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_17| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_682 Int) (v_ArrVal_692 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81| v_ArrVal_682)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_11| |c_ULTIMATE.start_main_~list~0#1.base|) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|))) is different from false [2021-12-15 14:05:46,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:46,482 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:46,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-15 14:05:46,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:46,488 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 36 treesize of output 24 [2021-12-15 14:05:46,491 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 7 treesize of output 3 [2021-12-15 14:05:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:46,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558888366] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:46,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:46,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 32 [2021-12-15 14:05:46,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760149755] [2021-12-15 14:05:46,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:46,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-15 14:05:46,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:46,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 14:05:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=486, Unknown=17, NotChecked=364, Total=992 [2021-12-15 14:05:46,512 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:47,192 INFO L93 Difference]: Finished difference Result 368 states and 400 transitions. [2021-12-15 14:05:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 14:05:47,193 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-15 14:05:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:47,194 INFO L225 Difference]: With dead ends: 368 [2021-12-15 14:05:47,194 INFO L226 Difference]: Without dead ends: 368 [2021-12-15 14:05:47,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 43 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=1241, Unknown=17, NotChecked=574, Total=2162 [2021-12-15 14:05:47,196 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 638 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1758 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:47,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 685 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 533 Invalid, 0 Unknown, 1758 Unchecked, 0.3s Time] [2021-12-15 14:05:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-12-15 14:05:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 155. [2021-12-15 14:05:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.263157894736842) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2021-12-15 14:05:47,200 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 30 [2021-12-15 14:05:47,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:47,201 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2021-12-15 14:05:47,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2021-12-15 14:05:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 14:05:47,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:47,202 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:47,229 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-15 14:05:47,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:47,412 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:47,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:47,412 INFO L85 PathProgramCache]: Analyzing trace with hash 20301398, now seen corresponding path program 2 times [2021-12-15 14:05:47,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:47,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319456486] [2021-12-15 14:05:47,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:47,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:47,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:47,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319456486] [2021-12-15 14:05:47,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319456486] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:47,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453272684] [2021-12-15 14:05:47,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:05:47,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:47,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:47,735 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-15 14:05:47,738 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-15 14:05:47,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 14:05:47,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:05:47,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 14:05:47,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:47,842 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-15 14:05:47,855 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-15 14:05:47,914 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:47,915 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-15 14:05:47,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:47,953 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-15 14:05:47,960 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-15 14:05:48,014 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-15 14:05:48,044 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-15 14:05:48,068 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-15 14:05:48,094 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:48,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 14:05:48,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:48,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, 2 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-15 14:05:48,152 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 16 treesize of output 8 [2021-12-15 14:05:48,175 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-15 14:05:48,199 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-15 14:05:48,234 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-15 14:05:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:48,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:48,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:48,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:48,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:48,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-15 14:05:48,471 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:48,472 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 13 treesize of output 12 [2021-12-15 14:05:48,482 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_804 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_20| Int)) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_804)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_811) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_20| |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2021-12-15 14:05:48,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_86| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_22| Int) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_804 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_20| Int)) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_86|) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_20| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_22|))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86| v_ArrVal_804)) |v_ULTIMATE.start_main_#t~malloc3#1.base_22| v_ArrVal_811) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))) is different from false [2021-12-15 14:05:48,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:48,662 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:48,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-15 14:05:48,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:48,668 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 36 treesize of output 24 [2021-12-15 14:05:48,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 7 treesize of output 3 [2021-12-15 14:05:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-15 14:05:48,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453272684] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:48,695 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:48,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 34 [2021-12-15 14:05:48,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22063985] [2021-12-15 14:05:48,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:48,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 14:05:48,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 14:05:48,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=610, Unknown=16, NotChecked=342, Total=1122 [2021-12-15 14:05:48,697 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:49,368 INFO L93 Difference]: Finished difference Result 353 states and 384 transitions. [2021-12-15 14:05:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 14:05:49,368 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-15 14:05:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:49,369 INFO L225 Difference]: With dead ends: 353 [2021-12-15 14:05:49,369 INFO L226 Difference]: Without dead ends: 353 [2021-12-15 14:05:49,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=329, Invalid=1319, Unknown=16, NotChecked=498, Total=2162 [2021-12-15 14:05:49,370 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 538 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1231 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:49,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 581 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 627 Invalid, 0 Unknown, 1231 Unchecked, 0.3s Time] [2021-12-15 14:05:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-15 14:05:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 163. [2021-12-15 14:05:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 162 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2021-12-15 14:05:49,374 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 33 [2021-12-15 14:05:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:49,375 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2021-12-15 14:05:49,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2021-12-15 14:05:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 14:05:49,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:49,375 INFO L514 BasicCegarLoop]: trace histogram [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-15 14:05:49,403 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-15 14:05:49,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-15 14:05:49,599 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1167746943, now seen corresponding path program 1 times [2021-12-15 14:05:49,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:49,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506537964] [2021-12-15 14:05:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:49,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:49,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:49,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506537964] [2021-12-15 14:05:49,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506537964] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:49,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945418831] [2021-12-15 14:05:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:49,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:49,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:49,908 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-15 14:05:49,909 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-15 14:05:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:50,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-15 14:05:50,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:50,026 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-15 14:05:50,068 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:50,069 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-15 14:05:50,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:50,106 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-15 14:05:50,221 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:50,222 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 21 treesize of output 25 [2021-12-15 14:05:50,231 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 11 treesize of output 7 [2021-12-15 14:05:50,257 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:50,257 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-15 14:05:50,309 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:50,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2021-12-15 14:05:50,312 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-15 14:05:50,315 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 19 treesize of output 11 [2021-12-15 14:05:50,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:50,469 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 15 treesize of output 7 [2021-12-15 14:05:50,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:50,474 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:50,474 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 27 treesize of output 18 [2021-12-15 14:05:50,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:50,526 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:50,526 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 17 treesize of output 10 [2021-12-15 14:05:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:50,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:50,798 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 82 treesize of output 62 [2021-12-15 14:05:50,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (and (= .cse0 |c_ULTIMATE.start_main_~end~0#1.offset|) (forall ((v_ArrVal_893 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) |c_ULTIMATE.start_main_~end~0#1.base|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_90|) (< |v_ULTIMATE.start_main_~end~0#1.offset_90| 0) (< .cse0 0)))) is different from false [2021-12-15 14:05:51,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_90|) (< .cse0 0) (let ((.cse1 (< |c_ULTIMATE.start_main_#t~mem4#1.offset| 0))) (and (<= |c_ULTIMATE.start_main_#t~mem4#1.offset| .cse0) (or .cse1 (forall ((v_ArrVal_893 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) |c_ULTIMATE.start_main_#t~mem4#1.base|))) (or .cse1 (<= .cse0 0)))) (< |v_ULTIMATE.start_main_~end~0#1.offset_90| 0)))) is different from false [2021-12-15 14:05:51,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_90|) (< .cse0 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (< .cse1 0))) (and (<= .cse1 .cse0) (or (<= .cse0 0) .cse2) (or (forall ((v_ArrVal_893 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) .cse3))) .cse2)))) (< |v_ULTIMATE.start_main_~end~0#1.offset_90| 0)))) is different from false [2021-12-15 14:05:51,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:51,441 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 82 treesize of output 66 [2021-12-15 14:05:51,446 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:51,446 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 66 treesize of output 66 [2021-12-15 14:05:51,453 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:51,454 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 100 treesize of output 95 [2021-12-15 14:05:51,462 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:51,462 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 106 treesize of output 109 [2021-12-15 14:05:51,466 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 109 treesize of output 103 [2021-12-15 14:05:51,472 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 57 treesize of output 55 [2021-12-15 14:05:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:51,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945418831] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:51,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:51,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 38 [2021-12-15 14:05:51,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236743822] [2021-12-15 14:05:51,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:51,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-15 14:05:51,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:51,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-15 14:05:51,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1081, Unknown=5, NotChecked=204, Total=1406 [2021-12-15 14:05:51,852 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:52,763 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2021-12-15 14:05:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 14:05:52,763 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-15 14:05:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:52,764 INFO L225 Difference]: With dead ends: 170 [2021-12-15 14:05:52,764 INFO L226 Difference]: Without dead ends: 170 [2021-12-15 14:05:52,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=1962, Unknown=5, NotChecked=282, Total=2550 [2021-12-15 14:05:52,766 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 166 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 591 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:52,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 882 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 872 Invalid, 0 Unknown, 591 Unchecked, 0.4s Time] [2021-12-15 14:05:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-15 14:05:52,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2021-12-15 14:05:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.25) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2021-12-15 14:05:52,769 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 35 [2021-12-15 14:05:52,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:52,769 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2021-12-15 14:05:52,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:05:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2021-12-15 14:05:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 14:05:52,770 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:52,770 INFO L514 BasicCegarLoop]: trace histogram [3, 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-15 14:05:52,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-15 14:05:52,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:52,983 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-15 14:05:52,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1209765196, now seen corresponding path program 2 times [2021-12-15 14:05:52,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:52,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355221871] [2021-12-15 14:05:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:52,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:53,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:53,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355221871] [2021-12-15 14:05:53,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355221871] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:53,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096434791] [2021-12-15 14:05:53,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 14:05:53,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:53,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:53,167 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-15 14:05:53,168 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-15 14:05:53,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 14:05:53,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 14:05:53,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-15 14:05:53,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:53,261 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-15 14:05:53,329 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:53,330 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-15 14:05:53,356 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-15 14:05:53,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:05:53,481 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-15 14:05:53,482 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 27 treesize of output 22 [2021-12-15 14:05:53,488 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-15 14:05:53,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:53,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:53,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:53,585 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 14:05:53,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2021-12-15 14:05:53,596 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-15 14:05:53,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2021-12-15 14:05:54,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:54,057 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:54,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:54,064 INFO L354 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2021-12-15 14:05:54,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 42 [2021-12-15 14:05:54,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:54,072 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:54,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2021-12-15 14:05:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:54,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:06:00,809 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:06:00,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 114292 treesize of output 102937 [2021-12-15 14:06:04,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:06:04,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:06:06,008 INFO L354 Elim1Store]: treesize reduction 624, result has 48.3 percent of original size [2021-12-15 14:06:06,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 92 case distinctions, treesize of input 689916 treesize of output 661701