./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-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/dll-optional-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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:04:23,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:04:23,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:04:23,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:04:23,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:04:23,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:04:23,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:04:23,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:04:23,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:04:23,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:04:23,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:04:23,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:04:23,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:04:23,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:04:23,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:04:23,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:04:23,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:04:23,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:04:23,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:04:23,456 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:04:23,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:04:23,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:04:23,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:04:23,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:04:23,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:04:23,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:04:23,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:04:23,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:04:23,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:04:23,463 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:04:23,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:04:23,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:04:23,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:04:23,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:04:23,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:04:23,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:04:23,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:04:23,467 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:04:23,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:04:23,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:04:23,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:04:23,470 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:04:23,497 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:04:23,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:04:23,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:04:23,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:04:23,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:04:23,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:04:23,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:04:23,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:04:23,499 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:04:23,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:04:23,500 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 14:04:23,500 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:04:23,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:04:23,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 14:04:23,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:04:23,500 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:04:23,500 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:04:23,501 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:04:23,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:04:23,501 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:04:23,501 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 14:04:23,501 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:04:23,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:04:23,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:04:23,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:04:23,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:23,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:04:23,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:04:23,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:04:23,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:04:23,502 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:04:23,503 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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2021-12-15 14:04:23,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:04:23,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:04:23,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:04:23,713 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:04:23,713 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:04:23,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-12-15 14:04:23,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90216e7e/c968e79167ad4db9a554d83078b2dbbf/FLAGcd54dc572 [2021-12-15 14:04:24,343 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:04:24,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-12-15 14:04:24,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90216e7e/c968e79167ad4db9a554d83078b2dbbf/FLAGcd54dc572 [2021-12-15 14:04:24,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e90216e7e/c968e79167ad4db9a554d83078b2dbbf [2021-12-15 14:04:24,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:04:24,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:04:24,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:24,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:04:24,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:04:24,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e2190a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:24, skipping insertion in model container [2021-12-15 14:04:24,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:04:24" (1/1) ... [2021-12-15 14:04:24,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:04:24,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:04:24,925 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/dll-optional-1.i[22753,22766] [2021-12-15 14:04:24,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:24,942 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:04:24,985 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/dll-optional-1.i[22753,22766] [2021-12-15 14:04:24,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:04:25,014 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:04:25,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25 WrapperNode [2021-12-15 14:04:25,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:04:25,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:25,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:04:25,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:04:25,021 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:04:25" (1/1) ... [2021-12-15 14:04:25,044 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:04:25" (1/1) ... [2021-12-15 14:04:25,064 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2021-12-15 14:04:25,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:04:25,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:04:25,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:04:25,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:04:25,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:04:25,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:04:25,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:04:25,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:04:25,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (1/1) ... [2021-12-15 14:04:25,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:04:25,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:25,157 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:04:25,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 14:04:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 14:04:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 14:04:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 14:04:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 14:04:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 14:04:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 14:04:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:04:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 14:04:25,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:04:25,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:04:25,251 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:04:25,252 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:04:25,564 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:04:25,571 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:04:25,576 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-15 14:04:25,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:25 BoogieIcfgContainer [2021-12-15 14:04:25,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:04:25,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:04:25,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:04:25,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:04:25,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:04:24" (1/3) ... [2021-12-15 14:04:25,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c827169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:25, skipping insertion in model container [2021-12-15 14:04:25,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:04:25" (2/3) ... [2021-12-15 14:04:25,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c827169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:04:25, skipping insertion in model container [2021-12-15 14:04:25,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:04:25" (3/3) ... [2021-12-15 14:04:25,589 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2021-12-15 14:04:25,592 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:04:25,592 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-12-15 14:04:25,619 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:04:25,624 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:04:25,624 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-12-15 14:04:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 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:04:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:25,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:25,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:25,651 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:25,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:04:25,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:25,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499012239] [2021-12-15 14:04:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:25,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:25,797 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:04:25,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:25,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499012239] [2021-12-15 14:04:25,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499012239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:25,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:25,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:25,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805096851] [2021-12-15 14:04:25,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:25,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:25,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:25,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:25,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:25,833 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 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:04:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:25,973 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2021-12-15 14:04:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:25,976 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:04:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:25,985 INFO L225 Difference]: With dead ends: 154 [2021-12-15 14:04:25,985 INFO L226 Difference]: Without dead ends: 150 [2021-12-15 14:04:25,986 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:04:25,989 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:25,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 87 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-15 14:04:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2021-12-15 14:04:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.9024390243902438) internal successors, (156), 143 states have internal predecessors, (156), 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:04:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2021-12-15 14:04:26,028 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 3 [2021-12-15 14:04:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,028 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2021-12-15 14:04:26,028 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:04:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2021-12-15 14:04:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:04:26,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:04:26,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:04:26,030 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:26,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,032 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:04:26,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675131680] [2021-12-15 14:04:26,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,066 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:04:26,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675131680] [2021-12-15 14:04:26,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675131680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:04:26,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077351184] [2021-12-15 14:04:26,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:26,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:26,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:26,070 INFO L87 Difference]: Start difference. First operand 144 states and 156 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:04:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,152 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2021-12-15 14:04:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:26,152 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:04:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,155 INFO L225 Difference]: With dead ends: 139 [2021-12-15 14:04:26,155 INFO L226 Difference]: Without dead ends: 139 [2021-12-15 14:04:26,158 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:04:26,159 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 113 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 100 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-15 14:04:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2021-12-15 14:04:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 134 states have internal predecessors, (147), 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:04:26,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2021-12-15 14:04:26,171 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2021-12-15 14:04:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,175 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2021-12-15 14:04:26,175 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:04:26,175 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2021-12-15 14:04:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:26,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:04:26,176 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2021-12-15 14:04:26,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628588062] [2021-12-15 14:04:26,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,228 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:04:26,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628588062] [2021-12-15 14:04:26,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628588062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:26,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990126296] [2021-12-15 14:04:26,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:26,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,231 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:04:26,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,374 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2021-12-15 14:04:26,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:26,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:04:26,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,375 INFO L225 Difference]: With dead ends: 179 [2021-12-15 14:04:26,376 INFO L226 Difference]: Without dead ends: 179 [2021-12-15 14:04:26,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:26,377 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 51 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 330 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-15 14:04:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2021-12-15 14:04:26,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 133 states have internal predecessors, (146), 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:04:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-12-15 14:04:26,381 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 12 [2021-12-15 14:04:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,381 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-12-15 14:04:26,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:04:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2021-12-15 14:04:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 14:04:26,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:04:26,383 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2021-12-15 14:04:26,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445811282] [2021-12-15 14:04:26,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,443 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:04:26,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445811282] [2021-12-15 14:04:26,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445811282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:26,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012090459] [2021-12-15 14:04:26,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:26,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:26,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:26,445 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:04:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,574 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2021-12-15 14:04:26,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:04:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,575 INFO L225 Difference]: With dead ends: 133 [2021-12-15 14:04:26,575 INFO L226 Difference]: Without dead ends: 133 [2021-12-15 14:04:26,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:26,576 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-15 14:04:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-12-15 14:04:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7682926829268293) internal successors, (145), 132 states have internal predecessors, (145), 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:04:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2021-12-15 14:04:26,580 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 12 [2021-12-15 14:04:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,580 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2021-12-15 14:04:26,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:04:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2021-12-15 14:04:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 14:04:26,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:04:26,582 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:26,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2021-12-15 14:04:26,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609977647] [2021-12-15 14:04:26,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,652 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:04:26,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609977647] [2021-12-15 14:04:26,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609977647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,653 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:26,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156123148] [2021-12-15 14:04:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:26,654 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:26,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:26,654 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:04:26,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,768 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2021-12-15 14:04:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:26,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:04:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,774 INFO L225 Difference]: With dead ends: 134 [2021-12-15 14:04:26,775 INFO L226 Difference]: Without dead ends: 134 [2021-12-15 14:04:26,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 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:04:26,776 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 183 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 75 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-15 14:04:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2021-12-15 14:04:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 124 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:04:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2021-12-15 14:04:26,779 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 13 [2021-12-15 14:04:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,779 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2021-12-15 14:04:26,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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:04:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2021-12-15 14:04:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 14:04:26,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:04:26,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:26,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2021-12-15 14:04:26,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:26,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162506017] [2021-12-15 14:04:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:26,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:26,841 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:04:26,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162506017] [2021-12-15 14:04:26,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162506017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:26,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:26,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 14:04:26,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503404557] [2021-12-15 14:04:26,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:26,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:04:26,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:26,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:04:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:04:26,843 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 6 states, 5 states have (on average 2.6) 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:04:26,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:26,993 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2021-12-15 14:04:26,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:26,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) 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:04:26,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:26,994 INFO L225 Difference]: With dead ends: 183 [2021-12-15 14:04:26,994 INFO L226 Difference]: Without dead ends: 183 [2021-12-15 14:04:26,994 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:04:26,995 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 236 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:26,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 114 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-15 14:04:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2021-12-15 14:04:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 155 states have internal predecessors, (183), 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:04:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2021-12-15 14:04:26,998 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 13 [2021-12-15 14:04:26,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:26,998 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2021-12-15 14:04:26,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) 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:04:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2021-12-15 14:04:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:04:26,999 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:26,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:26,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:04:26,999 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:26,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:26,999 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2021-12-15 14:04:26,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168317512] [2021-12-15 14:04:27,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,031 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:04:27,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168317512] [2021-12-15 14:04:27,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168317512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:27,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506065905] [2021-12-15 14:04:27,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:27,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:27,033 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:04:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,137 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2021-12-15 14:04:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 14:04:27,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2021-12-15 14:04:27,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,138 INFO L225 Difference]: With dead ends: 155 [2021-12-15 14:04:27,138 INFO L226 Difference]: Without dead ends: 155 [2021-12-15 14:04:27,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:27,139 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 308 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-15 14:04:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-12-15 14:04:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 154 states have internal predecessors, (181), 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:04:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2021-12-15 14:04:27,142 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 16 [2021-12-15 14:04:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,142 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2021-12-15 14:04:27,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:04:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2021-12-15 14:04:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 14:04:27,143 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,143 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:04:27,144 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:27,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2021-12-15 14:04:27,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153921355] [2021-12-15 14:04:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,193 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:04:27,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153921355] [2021-12-15 14:04:27,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153921355] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:27,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277779236] [2021-12-15 14:04:27,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:27,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:27,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:27,196 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:04:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,317 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2021-12-15 14:04:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:27,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2021-12-15 14:04:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,318 INFO L225 Difference]: With dead ends: 154 [2021-12-15 14:04:27,318 INFO L226 Difference]: Without dead ends: 154 [2021-12-15 14:04:27,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:27,319 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 299 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-15 14:04:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-12-15 14:04:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.504201680672269) internal successors, (179), 153 states have internal predecessors, (179), 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:04:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2021-12-15 14:04:27,323 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 16 [2021-12-15 14:04:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,323 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2021-12-15 14:04:27,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:04:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2021-12-15 14:04:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:04:27,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:27,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:04:27,325 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:27,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1504363226, now seen corresponding path program 1 times [2021-12-15 14:04:27,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250180653] [2021-12-15 14:04:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,351 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:04:27,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250180653] [2021-12-15 14:04:27,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250180653] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:27,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412506777] [2021-12-15 14:04:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:27,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:27,354 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:04:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,428 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2021-12-15 14:04:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:27,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2021-12-15 14:04:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,429 INFO L225 Difference]: With dead ends: 173 [2021-12-15 14:04:27,429 INFO L226 Difference]: Without dead ends: 173 [2021-12-15 14:04:27,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:27,430 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 174 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 163 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:27,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-15 14:04:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2021-12-15 14:04:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 153 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:04:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2021-12-15 14:04:27,433 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 18 [2021-12-15 14:04:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,434 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2021-12-15 14:04:27,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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:04:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2021-12-15 14:04:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:04:27,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,435 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:04:27,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:04:27,435 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394517, now seen corresponding path program 1 times [2021-12-15 14:04:27,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540956656] [2021-12-15 14:04:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,501 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:04:27,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540956656] [2021-12-15 14:04:27,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540956656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:27,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629796110] [2021-12-15 14:04:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:04:27,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:04:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:27,503 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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:04:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:27,734 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2021-12-15 14:04:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:27,735 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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:04:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:27,736 INFO L225 Difference]: With dead ends: 155 [2021-12-15 14:04:27,736 INFO L226 Difference]: Without dead ends: 155 [2021-12-15 14:04:27,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:04:27,737 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 176 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:27,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 257 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-15 14:04:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2021-12-15 14:04:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 152 states have internal predecessors, (176), 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:04:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2021-12-15 14:04:27,741 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 20 [2021-12-15 14:04:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:27,742 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2021-12-15 14:04:27,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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:04:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2021-12-15 14:04:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 14:04:27,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:27,745 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:04:27,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 14:04:27,745 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394518, now seen corresponding path program 1 times [2021-12-15 14:04:27,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:27,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942397359] [2021-12-15 14:04:27,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:27,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:27,864 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:04:27,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:27,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942397359] [2021-12-15 14:04:27,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942397359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:27,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:27,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:27,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394567110] [2021-12-15 14:04:27,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:27,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:27,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:27,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:27,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:27,867 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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:04:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,245 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2021-12-15 14:04:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 14:04:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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:04:28,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,247 INFO L225 Difference]: With dead ends: 146 [2021-12-15 14:04:28,247 INFO L226 Difference]: Without dead ends: 146 [2021-12-15 14:04:28,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-15 14:04:28,250 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 171 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 352 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-15 14:04:28,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2021-12-15 14:04:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 133 states have internal predecessors, (156), 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:04:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-15 14:04:28,255 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2021-12-15 14:04:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,260 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-15 14:04:28,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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:04:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-15 14:04:28,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:04:28,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,261 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:04:28,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 14:04:28,261 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1737058081, now seen corresponding path program 1 times [2021-12-15 14:04:28,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172650873] [2021-12-15 14:04:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,292 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:04:28,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172650873] [2021-12-15 14:04:28,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172650873] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:28,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433292306] [2021-12-15 14:04:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:28,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:28,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:28,294 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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:04:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,307 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2021-12-15 14:04:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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:04:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,308 INFO L225 Difference]: With dead ends: 160 [2021-12-15 14:04:28,308 INFO L226 Difference]: Without dead ends: 160 [2021-12-15 14:04:28,308 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:04:28,309 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 316 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-15 14:04:28,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2021-12-15 14:04:28,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.391304347826087) internal successors, (160), 137 states have internal predecessors, (160), 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:04:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2021-12-15 14:04:28,312 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 21 [2021-12-15 14:04:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,312 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2021-12-15 14:04:28,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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:04:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2021-12-15 14:04:28,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:28,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,313 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] [2021-12-15 14:04:28,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:04:28,313 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:28,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1420838518, now seen corresponding path program 1 times [2021-12-15 14:04:28,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878515239] [2021-12-15 14:04:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,337 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:04:28,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878515239] [2021-12-15 14:04:28,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878515239] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:28,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147466780] [2021-12-15 14:04:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:04:28,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:04:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:28,339 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,343 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2021-12-15 14:04:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:04:28,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:04:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,344 INFO L225 Difference]: With dead ends: 140 [2021-12-15 14:04:28,345 INFO L226 Difference]: Without dead ends: 140 [2021-12-15 14:04:28,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:04:28,345 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-15 14:04:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-12-15 14:04:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 139 states have internal predecessors, (162), 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:04:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2021-12-15 14:04:28,348 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 23 [2021-12-15 14:04:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,348 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2021-12-15 14:04:28,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2021-12-15 14:04:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:28,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,349 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] [2021-12-15 14:04:28,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 14:04:28,349 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462334, now seen corresponding path program 1 times [2021-12-15 14:04:28,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972291715] [2021-12-15 14:04:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,423 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:04:28,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972291715] [2021-12-15 14:04:28,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972291715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:28,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719292029] [2021-12-15 14:04:28,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:28,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:28,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:28,425 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:28,669 INFO L93 Difference]: Finished difference Result 265 states and 307 transitions. [2021-12-15 14:04:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:04:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:04:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:28,670 INFO L225 Difference]: With dead ends: 265 [2021-12-15 14:04:28,670 INFO L226 Difference]: Without dead ends: 265 [2021-12-15 14:04:28,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:04:28,671 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 285 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:28,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 384 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-12-15 14:04:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 154. [2021-12-15 14:04:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 153 states have internal predecessors, (180), 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:04:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2021-12-15 14:04:28,674 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 23 [2021-12-15 14:04:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:28,674 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2021-12-15 14:04:28,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2021-12-15 14:04:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:04:28,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:28,675 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] [2021-12-15 14:04:28,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 14:04:28,675 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462335, now seen corresponding path program 1 times [2021-12-15 14:04:28,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:28,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626970872] [2021-12-15 14:04:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:28,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:28,757 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:04:28,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:28,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626970872] [2021-12-15 14:04:28,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626970872] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:28,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:28,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:28,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514331865] [2021-12-15 14:04:28,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:28,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:28,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:28,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:28,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:28,759 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,079 INFO L93 Difference]: Finished difference Result 235 states and 268 transitions. [2021-12-15 14:04:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:04:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:04:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,081 INFO L225 Difference]: With dead ends: 235 [2021-12-15 14:04:29,081 INFO L226 Difference]: Without dead ends: 235 [2021-12-15 14:04:29,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:04:29,081 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 262 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 397 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-12-15 14:04:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 150. [2021-12-15 14:04:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 149 states have internal predecessors, (174), 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:04:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2021-12-15 14:04:29,084 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 23 [2021-12-15 14:04:29,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,085 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2021-12-15 14:04:29,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2021-12-15 14:04:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-15 14:04:29,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,085 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] [2021-12-15 14:04:29,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:04:29,086 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 375423567, now seen corresponding path program 1 times [2021-12-15 14:04:29,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462227602] [2021-12-15 14:04:29,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,137 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:04:29,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462227602] [2021-12-15 14:04:29,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462227602] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 14:04:29,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672600463] [2021-12-15 14:04:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:29,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:29,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:29,139 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:04:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,383 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2021-12-15 14:04:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:04:29,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-15 14:04:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,384 INFO L225 Difference]: With dead ends: 225 [2021-12-15 14:04:29,384 INFO L226 Difference]: Without dead ends: 225 [2021-12-15 14:04:29,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:29,385 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 229 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 360 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-15 14:04:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2021-12-15 14:04:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 155 states have internal predecessors, (181), 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:04:29,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2021-12-15 14:04:29,388 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 25 [2021-12-15 14:04:29,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,388 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2021-12-15 14:04:29,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:04:29,388 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2021-12-15 14:04:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:04:29,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,389 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] [2021-12-15 14:04:29,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 14:04:29,389 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:29,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash 729704446, now seen corresponding path program 1 times [2021-12-15 14:04:29,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309235203] [2021-12-15 14:04:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,458 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:04:29,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309235203] [2021-12-15 14:04:29,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309235203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:29,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128879781] [2021-12-15 14:04:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:04:29,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:04:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:29,460 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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:04:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:29,836 INFO L93 Difference]: Finished difference Result 318 states and 365 transitions. [2021-12-15 14:04:29,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 14:04:29,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:04:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:29,837 INFO L225 Difference]: With dead ends: 318 [2021-12-15 14:04:29,837 INFO L226 Difference]: Without dead ends: 318 [2021-12-15 14:04:29,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-15 14:04:29,838 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 345 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:29,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 497 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-12-15 14:04:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 169. [2021-12-15 14:04:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.356164383561644) internal successors, (198), 168 states have internal predecessors, (198), 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:04:29,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2021-12-15 14:04:29,842 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 27 [2021-12-15 14:04:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:29,842 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2021-12-15 14:04:29,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 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:04:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2021-12-15 14:04:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:04:29,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:29,843 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] [2021-12-15 14:04:29,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 14:04:29,843 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash 729704447, now seen corresponding path program 1 times [2021-12-15 14:04:29,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:29,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30757742] [2021-12-15 14:04:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:29,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:29,959 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:04:29,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:29,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30757742] [2021-12-15 14:04:29,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30757742] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:29,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:29,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:04:29,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582313197] [2021-12-15 14:04:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:29,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:04:29,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:04:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:04:29,961 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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:04:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,419 INFO L93 Difference]: Finished difference Result 251 states and 287 transitions. [2021-12-15 14:04:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 14:04:30,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:04:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,420 INFO L225 Difference]: With dead ends: 251 [2021-12-15 14:04:30,420 INFO L226 Difference]: Without dead ends: 251 [2021-12-15 14:04:30,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-15 14:04:30,421 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 302 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 524 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-15 14:04:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-15 14:04:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 169. [2021-12-15 14:04:30,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 168 states have internal predecessors, (197), 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:04:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2021-12-15 14:04:30,424 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 27 [2021-12-15 14:04:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,424 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2021-12-15 14:04:30,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 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:04:30,425 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2021-12-15 14:04:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-15 14:04:30,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,425 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] [2021-12-15 14:04:30,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 14:04:30,425 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1443803627, now seen corresponding path program 1 times [2021-12-15 14:04:30,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608435354] [2021-12-15 14:04:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:30,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608435354] [2021-12-15 14:04:30,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608435354] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:30,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551233482] [2021-12-15 14:04:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:30,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:30,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:30,445 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:04:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,457 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2021-12-15 14:04:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:04:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-15 14:04:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,458 INFO L225 Difference]: With dead ends: 181 [2021-12-15 14:04:30,458 INFO L226 Difference]: Without dead ends: 181 [2021-12-15 14:04:30,458 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:04:30,459 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 317 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:04:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-15 14:04:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2021-12-15 14:04:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 172 states have internal predecessors, (200), 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:04:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2021-12-15 14:04:30,461 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 27 [2021-12-15 14:04:30,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,461 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2021-12-15 14:04:30,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:04:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2021-12-15 14:04:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 14:04:30,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,462 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:04:30,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 14:04:30,462 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 17756513, now seen corresponding path program 1 times [2021-12-15 14:04:30,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125211544] [2021-12-15 14:04:30,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,490 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:04:30,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125211544] [2021-12-15 14:04:30,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125211544] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:30,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204948652] [2021-12-15 14:04:30,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:30,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:30,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:30,492 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:04:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,597 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2021-12-15 14:04:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:30,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:04:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,599 INFO L225 Difference]: With dead ends: 182 [2021-12-15 14:04:30,599 INFO L226 Difference]: Without dead ends: 182 [2021-12-15 14:04:30,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:30,599 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 296 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-15 14:04:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2021-12-15 14:04:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 171 states have internal predecessors, (199), 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:04:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2021-12-15 14:04:30,602 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 28 [2021-12-15 14:04:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,602 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2021-12-15 14:04:30,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:04:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2021-12-15 14:04:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 14:04:30,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,603 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:04:30,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 14:04:30,603 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 17756514, now seen corresponding path program 1 times [2021-12-15 14:04:30,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397501811] [2021-12-15 14:04:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,642 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:04:30,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397501811] [2021-12-15 14:04:30,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397501811] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:04:30,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217821823] [2021-12-15 14:04:30,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 14:04:30,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 14:04:30,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 14:04:30,644 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:04:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:30,732 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2021-12-15 14:04:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:30,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:04:30,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:30,733 INFO L225 Difference]: With dead ends: 171 [2021-12-15 14:04:30,733 INFO L226 Difference]: Without dead ends: 171 [2021-12-15 14:04:30,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:30,734 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:30,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-15 14:04:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-12-15 14:04:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.32) internal successors, (198), 170 states have internal predecessors, (198), 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:04:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2021-12-15 14:04:30,737 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 28 [2021-12-15 14:04:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:30,737 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2021-12-15 14:04:30,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:04:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2021-12-15 14:04:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 14:04:30,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:30,738 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] [2021-12-15 14:04:30,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-15 14:04:30,738 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash -42480305, now seen corresponding path program 1 times [2021-12-15 14:04:30,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:30,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134099203] [2021-12-15 14:04:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:30,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:30,829 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:04:30,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:30,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134099203] [2021-12-15 14:04:30,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134099203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:30,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:30,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-15 14:04:30,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728116391] [2021-12-15 14:04:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:30,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 14:04:30,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:30,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 14:04:30,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-15 14:04:30,832 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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:04:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:31,221 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2021-12-15 14:04:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 14:04:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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:04:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:31,224 INFO L225 Difference]: With dead ends: 251 [2021-12-15 14:04:31,224 INFO L226 Difference]: Without dead ends: 251 [2021-12-15 14:04:31,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-15 14:04:31,225 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 290 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:31,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 636 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-15 14:04:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2021-12-15 14:04:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 170 states have internal predecessors, (197), 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:04:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2021-12-15 14:04:31,228 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 29 [2021-12-15 14:04:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:31,228 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2021-12-15 14:04:31,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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:04:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2021-12-15 14:04:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 14:04:31,228 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:31,228 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:04:31,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-15 14:04:31,229 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:31,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:31,229 INFO L85 PathProgramCache]: Analyzing trace with hash 439757914, now seen corresponding path program 1 times [2021-12-15 14:04:31,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:31,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493383889] [2021-12-15 14:04:31,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:31,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,276 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:04:31,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493383889] [2021-12-15 14:04:31,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493383889] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446644345] [2021-12-15 14:04:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:31,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:31,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:31,279 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:04:31,300 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:04:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:31,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-15 14:04:31,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:31,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:31,462 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:04:31,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,508 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:04:31,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,513 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:04:31,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,556 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:04:31,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,560 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:04:31,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,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, 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:04:31,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:31,587 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:04:31,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:31,701 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:04:31,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:31,705 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:31,706 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:04:31,716 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:04:31,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:32,141 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:04:32,143 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:04:32,153 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:04:32,157 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:04:32,171 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:04:32,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446644345] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:32,171 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:32,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-15 14:04:32,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956807409] [2021-12-15 14:04:32,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:32,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 14:04:32,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 14:04:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-15 14:04:32,173 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 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:04:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:32,478 INFO L93 Difference]: Finished difference Result 212 states and 241 transitions. [2021-12-15 14:04:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 14:04:32,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 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:04:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:32,479 INFO L225 Difference]: With dead ends: 212 [2021-12-15 14:04:32,480 INFO L226 Difference]: Without dead ends: 212 [2021-12-15 14:04:32,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:04:32,480 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 187 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:32,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 517 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 375 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2021-12-15 14:04:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-12-15 14:04:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 184. [2021-12-15 14:04:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.3006134969325154) internal successors, (212), 183 states have internal predecessors, (212), 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:04:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2021-12-15 14:04:32,483 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2021-12-15 14:04:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:32,483 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2021-12-15 14:04:32,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 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:04:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2021-12-15 14:04:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 14:04:32,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:32,484 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, 1] [2021-12-15 14:04:32,520 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:04:32,700 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,SelfDestructingSolverStorable22 [2021-12-15 14:04:32,701 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:32,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:32,701 INFO L85 PathProgramCache]: Analyzing trace with hash -469775188, now seen corresponding path program 1 times [2021-12-15 14:04:32,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:32,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590772985] [2021-12-15 14:04:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:32,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:32,783 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:04:32,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:32,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590772985] [2021-12-15 14:04:32,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590772985] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:32,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:32,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 14:04:32,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908898363] [2021-12-15 14:04:32,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:32,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 14:04:32,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 14:04:32,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:04:32,786 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:33,049 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2021-12-15 14:04:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:04:33,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-15 14:04:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:33,050 INFO L225 Difference]: With dead ends: 232 [2021-12-15 14:04:33,050 INFO L226 Difference]: Without dead ends: 232 [2021-12-15 14:04:33,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-12-15 14:04:33,051 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 62 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:33,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 507 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:04:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-15 14:04:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2021-12-15 14:04:33,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 189 states have internal predecessors, (219), 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:04:33,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2021-12-15 14:04:33,055 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 31 [2021-12-15 14:04:33,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:33,055 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2021-12-15 14:04:33,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:33,056 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2021-12-15 14:04:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 14:04:33,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:33,056 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, 1, 1, 1, 1] [2021-12-15 14:04:33,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-15 14:04:33,056 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash 605010984, now seen corresponding path program 1 times [2021-12-15 14:04:33,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:33,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881855141] [2021-12-15 14:04:33,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:33,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:33,229 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:04:33,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:33,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881855141] [2021-12-15 14:04:33,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881855141] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:33,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:33,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-15 14:04:33,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896473929] [2021-12-15 14:04:33,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:33,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-15 14:04:33,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:33,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-15 14:04:33,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-15 14:04:33,231 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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:04:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:33,875 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2021-12-15 14:04:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 14:04:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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 34 [2021-12-15 14:04:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:33,877 INFO L225 Difference]: With dead ends: 223 [2021-12-15 14:04:33,877 INFO L226 Difference]: Without dead ends: 223 [2021-12-15 14:04:33,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2021-12-15 14:04:33,877 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 258 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:33,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 676 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 14:04:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-15 14:04:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 187. [2021-12-15 14:04:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 186 states have internal predecessors, (214), 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:04:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2021-12-15 14:04:33,880 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 34 [2021-12-15 14:04:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:33,880 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2021-12-15 14:04:33,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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:04:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2021-12-15 14:04:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 14:04:33,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:33,880 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, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:33,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-15 14:04:33,881 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1443725027, now seen corresponding path program 1 times [2021-12-15 14:04:33,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:33,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775402928] [2021-12-15 14:04:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:33,881 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:33,941 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:04:33,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:33,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775402928] [2021-12-15 14:04:33,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775402928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:33,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:33,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 14:04:33,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506830210] [2021-12-15 14:04:33,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:33,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:04:33,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:33,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:04:33,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 14:04:33,943 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:34,079 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2021-12-15 14:04:34,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 14:04:34,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 14:04:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:34,080 INFO L225 Difference]: With dead ends: 234 [2021-12-15 14:04:34,080 INFO L226 Difference]: Without dead ends: 234 [2021-12-15 14:04:34,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:04:34,081 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 217 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:34,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 323 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-15 14:04:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 204. [2021-12-15 14:04:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 203 states have internal predecessors, (232), 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:04:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2021-12-15 14:04:34,084 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 36 [2021-12-15 14:04:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:34,084 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2021-12-15 14:04:34,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2021-12-15 14:04:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 14:04:34,085 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:34,085 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, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:34,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-15 14:04:34,085 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1443714042, now seen corresponding path program 1 times [2021-12-15 14:04:34,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:34,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451048108] [2021-12-15 14:04:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:34,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:34,108 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:04:34,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:34,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451048108] [2021-12-15 14:04:34,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451048108] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:04:34,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:04:34,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 14:04:34,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343435092] [2021-12-15 14:04:34,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:04:34,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:04:34,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:34,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:04:34,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:04:34,110 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:34,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:34,197 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2021-12-15 14:04:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:04:34,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 14:04:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:34,198 INFO L225 Difference]: With dead ends: 221 [2021-12-15 14:04:34,198 INFO L226 Difference]: Without dead ends: 221 [2021-12-15 14:04:34,199 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:04:34,199 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 124 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:34,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 136 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:04:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-15 14:04:34,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2021-12-15 14:04:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 205 states have internal predecessors, (234), 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:04:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2021-12-15 14:04:34,202 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 36 [2021-12-15 14:04:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:34,202 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2021-12-15 14:04:34,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:04:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2021-12-15 14:04:34,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-15 14:04:34,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:34,203 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:34,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-15 14:04:34,203 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1805802628, now seen corresponding path program 1 times [2021-12-15 14:04:34,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:34,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468921611] [2021-12-15 14:04:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:34,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:34,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:34,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468921611] [2021-12-15 14:04:34,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468921611] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:34,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705096888] [2021-12-15 14:04:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:34,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:34,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:34,314 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:04:34,315 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:04:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:34,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 14:04:34,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:34,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:34,841 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 17 treesize of output 7 [2021-12-15 14:04:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:34,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:35,104 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:35,105 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 19 treesize of output 22 [2021-12-15 14:04:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:04:35,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705096888] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:35,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:35,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 29 [2021-12-15 14:04:35,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232869267] [2021-12-15 14:04:35,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:35,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-15 14:04:35,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:35,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-15 14:04:35,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2021-12-15 14:04:35,412 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 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:04:36,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:36,836 INFO L93 Difference]: Finished difference Result 419 states and 464 transitions. [2021-12-15 14:04:36,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-15 14:04:36,837 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 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 37 [2021-12-15 14:04:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:36,838 INFO L225 Difference]: With dead ends: 419 [2021-12-15 14:04:36,838 INFO L226 Difference]: Without dead ends: 419 [2021-12-15 14:04:36,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 62 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=669, Invalid=2871, Unknown=0, NotChecked=0, Total=3540 [2021-12-15 14:04:36,839 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 789 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 1385 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 545 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:36,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [789 Valid, 1385 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 915 Invalid, 0 Unknown, 545 Unchecked, 0.4s Time] [2021-12-15 14:04:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-12-15 14:04:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 318. [2021-12-15 14:04:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 297 states have (on average 1.245791245791246) internal successors, (370), 317 states have internal predecessors, (370), 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:04:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 370 transitions. [2021-12-15 14:04:36,855 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 370 transitions. Word has length 37 [2021-12-15 14:04:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:36,856 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 370 transitions. [2021-12-15 14:04:36,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 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:04:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 370 transitions. [2021-12-15 14:04:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 14:04:36,857 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:36,857 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:36,893 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:04:37,067 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,SelfDestructingSolverStorable27 [2021-12-15 14:04:37,068 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:37,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858598, now seen corresponding path program 1 times [2021-12-15 14:04:37,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:37,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436670870] [2021-12-15 14:04:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:37,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:37,398 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:04:37,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436670870] [2021-12-15 14:04:37,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436670870] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41640869] [2021-12-15 14:04:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:37,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:37,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:37,400 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:04:37,403 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:04:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:37,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-15 14:04:37,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:37,558 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:04:37,588 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:04:37,592 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:04:37,680 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:04:37,681 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:04:37,730 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-15 14:04:37,731 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 1 case distinctions, treesize of input 21 treesize of output 26 [2021-12-15 14:04:37,750 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-15 14:04:37,750 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-15 14:04:37,880 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:37,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2021-12-15 14:04:37,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-12-15 14:04:38,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:38,075 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 23 treesize of output 23 [2021-12-15 14:04:38,084 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:38,084 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 46 treesize of output 42 [2021-12-15 14:04:38,259 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:38,260 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 46 treesize of output 42 [2021-12-15 14:04:38,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:38,265 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 23 treesize of output 23 [2021-12-15 14:04:38,316 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:38,316 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 53 treesize of output 50 [2021-12-15 14:04:38,320 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 27 treesize of output 27 [2021-12-15 14:04:38,628 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-15 14:04:38,628 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 26 treesize of output 10 [2021-12-15 14:04:38,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-15 14:04:38,880 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:04:38,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:39,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1041 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-15 14:04:39,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1041 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-15 14:04:39,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1042) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1041 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-15 14:04:39,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1035))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1036) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-15 14:04:39,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1035))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1036) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1035) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1041)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-15 14:04:39,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1035))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1036) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-15 14:04:39,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1035))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|))) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1036) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1035) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-15 14:04:39,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1042 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_8| Int)) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1035))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1042)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1041 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1036) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_8| v_ArrVal_1035) |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1041) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_8| 1) .cse0) 1)))) is different from false [2021-12-15 14:04:39,513 INFO L354 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-15 14:04:39,513 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 2 case distinctions, treesize of input 97 treesize of output 110 [2021-12-15 14:04:39,525 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-15 14:04:39,526 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 2 case distinctions, treesize of input 163 treesize of output 116 [2021-12-15 14:04:39,533 INFO L354 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2021-12-15 14:04:39,533 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 382 treesize of output 328 [2021-12-15 14:04:39,542 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:39,543 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 494 treesize of output 476 [2021-12-15 14:04:39,552 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:39,553 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 476 treesize of output 454 [2021-12-15 14:04:39,558 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 454 treesize of output 438 [2021-12-15 14:04:39,566 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 41 treesize of output 37 [2021-12-15 14:04:39,570 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 37 treesize of output 33 [2021-12-15 14:04:45,653 WARN L227 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 18 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-15 14:04:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:04:45,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41640869] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:45,682 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:45,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 43 [2021-12-15 14:04:45,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427646372] [2021-12-15 14:04:45,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:45,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-15 14:04:45,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-15 14:04:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1069, Unknown=8, NotChecked=600, Total=1892 [2021-12-15 14:04:45,684 INFO L87 Difference]: Start difference. First operand 318 states and 370 transitions. Second operand has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 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:04:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:04:52,045 INFO L93 Difference]: Finished difference Result 384 states and 444 transitions. [2021-12-15 14:04:52,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 14:04:52,045 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 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 38 [2021-12-15 14:04:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:04:52,046 INFO L225 Difference]: With dead ends: 384 [2021-12-15 14:04:52,046 INFO L226 Difference]: Without dead ends: 384 [2021-12-15 14:04:52,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=467, Invalid=2300, Unknown=21, NotChecked=872, Total=3660 [2021-12-15 14:04:52,047 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 188 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1754 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:04:52,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 1657 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 593 Invalid, 0 Unknown, 1754 Unchecked, 0.3s Time] [2021-12-15 14:04:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-12-15 14:04:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 342. [2021-12-15 14:04:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 321 states have (on average 1.2398753894080996) internal successors, (398), 341 states have internal predecessors, (398), 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:04:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 398 transitions. [2021-12-15 14:04:52,056 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 398 transitions. Word has length 38 [2021-12-15 14:04:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:04:52,057 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 398 transitions. [2021-12-15 14:04:52,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 states have internal predecessors, (106), 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:04:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 398 transitions. [2021-12-15 14:04:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 14:04:52,058 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:04:52,058 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:04:52,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-15 14:04:52,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-15 14:04:52,268 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:04:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:04:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1535563358, now seen corresponding path program 1 times [2021-12-15 14:04:52,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:04:52,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925883123] [2021-12-15 14:04:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:52,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:04:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:52,552 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:04:52,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:04:52,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925883123] [2021-12-15 14:04:52,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925883123] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:04:52,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736826970] [2021-12-15 14:04:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:04:52,553 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:04:52,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:04:52,572 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:04:52,611 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:04:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:04:52,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-15 14:04:52,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:04:52,749 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:04:52,775 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:04:52,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:52,797 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 23 treesize of output 22 [2021-12-15 14:04:52,852 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:04:52,853 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:04:52,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:04:52,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:04:52,894 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:04:52,976 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:04:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-15 14:04:52,982 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 20 treesize of output 22 [2021-12-15 14:04:53,006 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:04:53,055 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:04:53,085 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:04:53,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 14:04:53,145 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:04:53,180 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:04:53,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:04:53,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) is different from false [2021-12-15 14:04:53,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) is different from false [2021-12-15 14:04:53,270 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) is different from false [2021-12-15 14:04:53,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1169) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1170) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) is different from false [2021-12-15 14:04:53,283 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1169 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1169) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1170) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1173)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) is different from false [2021-12-15 14:04:53,292 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2021-12-15 14:04:53,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2021-12-15 14:04:53,299 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 26 treesize of output 24 [2021-12-15 14:04:53,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,833 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:53,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 96 [2021-12-15 14:04:53,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,840 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:53,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 190 [2021-12-15 14:04:53,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,844 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:04:53,846 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:04:53,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 183 [2021-12-15 14:04:53,855 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 62 treesize of output 54 [2021-12-15 14:04:53,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2021-12-15 14:04:53,909 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:04:53,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736826970] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:04:53,910 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:04:53,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 16] total 39 [2021-12-15 14:04:53,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097020004] [2021-12-15 14:04:53,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:04:53,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-15 14:04:53,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:04:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-15 14:04:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=981, Unknown=18, NotChecked=340, Total=1482 [2021-12-15 14:04:53,913 INFO L87 Difference]: Start difference. First operand 342 states and 398 transitions. Second operand has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 39 states have internal predecessors, (101), 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:04:55,268 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|) (not (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)))) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int)) (or (let ((.cse1 (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|))) (and (or (not .cse1) (forall ((v_ArrVal_1165 Int) (v_ArrVal_1169 (Array Int Int)) (v_arrayElimCell_53 Int) (v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1165)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1169) v_arrayElimCell_53 v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)))))) (or (forall ((v_ArrVal_1165 Int) (v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1165)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) .cse1))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|))))) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_67| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_67|) (let ((.cse2 (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|))) (and (or (forall ((v_ArrVal_1165 Int) (v_ArrVal_1169 (Array Int Int)) (v_arrayElimCell_53 Int) (v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_67| v_ArrVal_1165)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1169) v_arrayElimCell_53 v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) (not .cse2)) (or .cse2 (forall ((v_ArrVal_1165 Int) (v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_67| v_ArrVal_1165)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|))))) (not (= |c_ULTIMATE.start_main_~x~0#1.base| (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (< |c_ULTIMATE.start_main_~x~0#1.offset| (+ |c_ULTIMATE.start_main_~head~0#1.offset| 1)) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_67| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_67|) (let ((.cse4 (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|))) (and (or .cse4 (forall ((v_ArrVal_1165 Int) (v_ArrVal_1164 Int) (v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8) v_ArrVal_1164) |v_ULTIMATE.start_main_~x~0#1.offset_67| v_ArrVal_1165)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)))))) (or (not .cse4) (forall ((v_ArrVal_1165 Int) (v_ArrVal_1164 Int) (v_ArrVal_1169 (Array Int Int)) (v_arrayElimCell_53 Int) (v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8) v_ArrVal_1164) |v_ULTIMATE.start_main_~x~0#1.offset_67| v_ArrVal_1165)) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1169) v_arrayElimCell_53 v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12)))))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_11|))))) (forall ((v_ArrVal_1173 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1173) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) (= (select .cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8)) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (= (select .cse3 .cse0) |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0))) is different from false [2021-12-15 14:05:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:08,522 INFO L93 Difference]: Finished difference Result 732 states and 838 transitions. [2021-12-15 14:05:08,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-15 14:05:08,524 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 39 states have internal predecessors, (101), 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 38 [2021-12-15 14:05:08,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:08,526 INFO L225 Difference]: With dead ends: 732 [2021-12-15 14:05:08,526 INFO L226 Difference]: Without dead ends: 732 [2021-12-15 14:05:08,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 55 SyntacticMatches, 19 SemanticMatches, 69 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1299 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=770, Invalid=3381, Unknown=33, NotChecked=786, Total=4970 [2021-12-15 14:05:08,528 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 1079 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 3954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2196 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:08,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1079 Valid, 1872 Invalid, 3954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1556 Invalid, 0 Unknown, 2196 Unchecked, 0.8s Time] [2021-12-15 14:05:08,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2021-12-15 14:05:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 358. [2021-12-15 14:05:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 337 states have (on average 1.228486646884273) internal successors, (414), 357 states have internal predecessors, (414), 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:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 414 transitions. [2021-12-15 14:05:08,538 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 414 transitions. Word has length 38 [2021-12-15 14:05:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:08,538 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 414 transitions. [2021-12-15 14:05:08,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.58974358974359) internal successors, (101), 39 states have internal predecessors, (101), 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:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 414 transitions. [2021-12-15 14:05:08,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 14:05:08,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:08,539 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:08,558 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:08,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:08,753 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -444306697, now seen corresponding path program 1 times [2021-12-15 14:05:08,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:08,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672574181] [2021-12-15 14:05:08,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:08,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:08,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:08,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:08,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672574181] [2021-12-15 14:05:08,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672574181] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:08,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367569586] [2021-12-15 14:05:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:08,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:08,889 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:08,890 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:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:08,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 14:05:08,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:09,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:09,323 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 17 treesize of output 7 [2021-12-15 14:05:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:09,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:09,536 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:09,536 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 22 treesize of output 25 [2021-12-15 14:05:09,823 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-15 14:05:09,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2021-12-15 14:05:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:09,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367569586] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:09,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:09,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2021-12-15 14:05:09,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314387486] [2021-12-15 14:05:09,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:09,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-15 14:05:09,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-15 14:05:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-12-15 14:05:09,931 INFO L87 Difference]: Start difference. First operand 358 states and 414 transitions. Second operand has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 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:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:10,876 INFO L93 Difference]: Finished difference Result 425 states and 488 transitions. [2021-12-15 14:05:10,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-15 14:05:10,877 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 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 38 [2021-12-15 14:05:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:10,878 INFO L225 Difference]: With dead ends: 425 [2021-12-15 14:05:10,878 INFO L226 Difference]: Without dead ends: 425 [2021-12-15 14:05:10,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=590, Invalid=2272, Unknown=0, NotChecked=0, Total=2862 [2021-12-15 14:05:10,879 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 495 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 542 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:10,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 821 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 648 Invalid, 0 Unknown, 542 Unchecked, 0.3s Time] [2021-12-15 14:05:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-12-15 14:05:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 353. [2021-12-15 14:05:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 332 states have (on average 1.2439759036144578) internal successors, (413), 352 states have internal predecessors, (413), 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:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 413 transitions. [2021-12-15 14:05:10,883 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 413 transitions. Word has length 38 [2021-12-15 14:05:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:10,883 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 413 transitions. [2021-12-15 14:05:10,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.2666666666666666) internal successors, (98), 30 states have internal predecessors, (98), 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:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 413 transitions. [2021-12-15 14:05:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 14:05:10,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:10,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:10,903 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:11,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:11,085 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:11,085 INFO L85 PathProgramCache]: Analyzing trace with hash 117734209, now seen corresponding path program 1 times [2021-12-15 14:05:11,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:11,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944607645] [2021-12-15 14:05:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:11,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:11,188 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:11,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:11,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944607645] [2021-12-15 14:05:11,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944607645] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:11,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749918248] [2021-12-15 14:05:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:11,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:11,190 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:11,191 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:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:11,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-15 14:05:11,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:11,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:11,552 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:11,555 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:11,556 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:11,556 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:11,589 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:11,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:11,771 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-15 14:05:11,771 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 24 treesize of output 23 [2021-12-15 14:05:11,775 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-15 14:05:11,775 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 20 treesize of output 12 [2021-12-15 14:05:11,972 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:11,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749918248] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:11,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:11,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2021-12-15 14:05:11,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557182155] [2021-12-15 14:05:11,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:11,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 14:05:11,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:11,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 14:05:11,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-12-15 14:05:11,974 INFO L87 Difference]: Start difference. First operand 353 states and 413 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:12,335 INFO L93 Difference]: Finished difference Result 470 states and 546 transitions. [2021-12-15 14:05:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 14:05:12,336 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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 39 [2021-12-15 14:05:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:12,337 INFO L225 Difference]: With dead ends: 470 [2021-12-15 14:05:12,337 INFO L226 Difference]: Without dead ends: 470 [2021-12-15 14:05:12,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2021-12-15 14:05:12,338 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 337 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:12,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 948 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 387 Invalid, 0 Unknown, 361 Unchecked, 0.2s Time] [2021-12-15 14:05:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-12-15 14:05:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 372. [2021-12-15 14:05:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 351 states have (on average 1.2478632478632479) internal successors, (438), 371 states have internal predecessors, (438), 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:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 438 transitions. [2021-12-15 14:05:12,343 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 438 transitions. Word has length 39 [2021-12-15 14:05:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:12,344 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 438 transitions. [2021-12-15 14:05:12,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 438 transitions. [2021-12-15 14:05:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:05:12,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:12,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:12,361 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:12,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:12,561 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash -645207573, now seen corresponding path program 1 times [2021-12-15 14:05:12,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:12,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385676493] [2021-12-15 14:05:12,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:12,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:12,623 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:12,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:12,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385676493] [2021-12-15 14:05:12,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385676493] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110143262] [2021-12-15 14:05:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:12,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:12,625 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:12,651 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:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:12,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-15 14:05:12,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:12,890 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:12,906 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:12,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:13,029 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:13,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110143262] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:13,029 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:13,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-15 14:05:13,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136458249] [2021-12-15 14:05:13,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:13,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 14:05:13,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:13,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 14:05:13,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 14:05:13,031 INFO L87 Difference]: Start difference. First operand 372 states and 438 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:13,150 INFO L93 Difference]: Finished difference Result 384 states and 449 transitions. [2021-12-15 14:05:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:05:13,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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 40 [2021-12-15 14:05:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:13,151 INFO L225 Difference]: With dead ends: 384 [2021-12-15 14:05:13,151 INFO L226 Difference]: Without dead ends: 356 [2021-12-15 14:05:13,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-15 14:05:13,151 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 24 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:13,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 298 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2021-12-15 14:05:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-12-15 14:05:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2021-12-15 14:05:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 335 states have (on average 1.2537313432835822) internal successors, (420), 355 states have internal predecessors, (420), 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:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 420 transitions. [2021-12-15 14:05:13,155 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 420 transitions. Word has length 40 [2021-12-15 14:05:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:13,155 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 420 transitions. [2021-12-15 14:05:13,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 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:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 420 transitions. [2021-12-15 14:05:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:05:13,156 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:13,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:13,174 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:13,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:13,367 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1766771785, now seen corresponding path program 1 times [2021-12-15 14:05:13,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:13,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410479030] [2021-12-15 14:05:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:13,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:13,599 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:13,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:13,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410479030] [2021-12-15 14:05:13,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410479030] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:13,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427056330] [2021-12-15 14:05:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:13,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:13,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:13,601 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:13,602 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:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:13,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-15 14:05:13,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:13,766 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:13,786 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:13,788 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:13,819 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:13,819 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:13,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:13,848 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:13,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:13,853 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:13,925 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:13,926 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:13,928 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 27 treesize of output 27 [2021-12-15 14:05:14,013 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:14,013 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:14,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:14,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 23 treesize of output 23 [2021-12-15 14:05:14,095 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:14,095 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:14,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:14,098 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 23 treesize of output 23 [2021-12-15 14:05:14,118 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:14,118 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:14,121 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 27 treesize of output 27 [2021-12-15 14:05:14,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:14,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-12-15 14:05:14,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:14,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-12-15 14:05:14,326 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:14,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:14,432 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1467) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1468 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-15 14:05:14,452 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1468 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1468) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1467) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-15 14:05:14,456 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1467) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1468 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1468) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-15 14:05:14,466 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1461))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1467)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1462) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1461) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1468) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-15 14:05:14,472 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1462) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1461) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1468)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1461))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1467)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-15 14:05:14,482 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1462) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1461) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1468) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1461))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1467)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-15 14:05:14,500 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|))) (and (forall ((v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1461))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1467)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1468 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1462) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1461) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1468) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-15 14:05:14,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:14,645 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:14,645 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 97 treesize of output 103 [2021-12-15 14:05:14,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:14,651 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:14,651 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 103 treesize of output 82 [2021-12-15 14:05:14,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:14,657 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:14,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 184 [2021-12-15 14:05:14,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:14,663 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:14,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 280 treesize of output 258 [2021-12-15 14:05:14,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2021-12-15 14:05:14,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 66 treesize of output 62 [2021-12-15 14:05:14,674 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 62 treesize of output 58 [2021-12-15 14:05:14,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2021-12-15 14:05:14,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:14,678 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 0 case distinctions, treesize of input 54 treesize of output 46 [2021-12-15 14:05:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:05:14,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427056330] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:14,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:14,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 34 [2021-12-15 14:05:14,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076032540] [2021-12-15 14:05:14,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:14,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-15 14:05:14,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:14,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-15 14:05:14,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=591, Unknown=8, NotChecked=392, Total=1122 [2021-12-15 14:05:14,710 INFO L87 Difference]: Start difference. First operand 356 states and 420 transitions. Second operand has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 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:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:15,250 INFO L93 Difference]: Finished difference Result 423 states and 489 transitions. [2021-12-15 14:05:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 14:05:15,250 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 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 40 [2021-12-15 14:05:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:15,251 INFO L225 Difference]: With dead ends: 423 [2021-12-15 14:05:15,252 INFO L226 Difference]: Without dead ends: 423 [2021-12-15 14:05:15,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1019, Unknown=8, NotChecked=518, Total=1806 [2021-12-15 14:05:15,253 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 170 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 946 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:15,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 1017 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 700 Invalid, 0 Unknown, 946 Unchecked, 0.2s Time] [2021-12-15 14:05:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-12-15 14:05:15,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 384. [2021-12-15 14:05:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 363 states have (on average 1.2396694214876034) internal successors, (450), 383 states have internal predecessors, (450), 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:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 450 transitions. [2021-12-15 14:05:15,257 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 450 transitions. Word has length 40 [2021-12-15 14:05:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:15,257 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 450 transitions. [2021-12-15 14:05:15,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 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:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 450 transitions. [2021-12-15 14:05:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:05:15,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:15,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:15,274 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:15,471 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,SelfDestructingSolverStorable33 [2021-12-15 14:05:15,471 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:15,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1293820847, now seen corresponding path program 1 times [2021-12-15 14:05:15,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:15,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640779277] [2021-12-15 14:05:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:15,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:15,801 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:15,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:15,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640779277] [2021-12-15 14:05:15,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640779277] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:15,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229816815] [2021-12-15 14:05:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:15,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:15,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:15,803 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:15,847 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:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:15,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 14:05:15,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:15,945 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:15,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, 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:15,974 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:16,011 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 14:05:16,012 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:16,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:16,032 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:16,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:16,037 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:16,088 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:16,089 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:16,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-15 14:05:16,201 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:16,202 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 16 treesize of output 22 [2021-12-15 14:05:16,205 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:16,217 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:16,217 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:16,278 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:16,278 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 16 treesize of output 22 [2021-12-15 14:05:16,281 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:16,300 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:16,301 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:16,340 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:16,340 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:16,343 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 20 treesize of output 22 [2021-12-15 14:05:16,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 14:05:16,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:16,472 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:16,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-12-15 14:05:16,482 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:16,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:16,535 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1601) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1600) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-15 14:05:16,555 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1601) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1600) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-15 14:05:16,561 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1600 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1600) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1601 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1601) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-15 14:05:16,574 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1594))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1601)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1595) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1600) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-15 14:05:16,579 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1594))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1601)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1595) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1594) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1600)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-15 14:05:16,606 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1593 Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1593)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1595) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1594) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1600) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1594 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1594))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1601)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-15 14:05:16,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:16,792 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:16,792 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 97 treesize of output 103 [2021-12-15 14:05:16,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:16,799 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:16,799 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 103 treesize of output 82 [2021-12-15 14:05:16,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:16,804 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:16,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 278 [2021-12-15 14:05:16,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:16,811 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:16,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 352 [2021-12-15 14:05:16,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 167 [2021-12-15 14:05:16,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:16,822 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 0 case distinctions, treesize of input 167 treesize of output 147 [2021-12-15 14:05:16,825 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 147 treesize of output 143 [2021-12-15 14:05:16,834 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 143 treesize of output 139 [2021-12-15 14:05:16,837 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 139 treesize of output 123 [2021-12-15 14:05:16,893 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:16,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229816815] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:16,893 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:16,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 31 [2021-12-15 14:05:16,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655963497] [2021-12-15 14:05:16,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:16,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-15 14:05:16,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-15 14:05:16,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=500, Unknown=11, NotChecked=306, Total=930 [2021-12-15 14:05:16,895 INFO L87 Difference]: Start difference. First operand 384 states and 450 transitions. Second operand has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 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:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:17,368 INFO L93 Difference]: Finished difference Result 419 states and 485 transitions. [2021-12-15 14:05:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 14:05:17,368 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 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 40 [2021-12-15 14:05:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:17,369 INFO L225 Difference]: With dead ends: 419 [2021-12-15 14:05:17,369 INFO L226 Difference]: Without dead ends: 419 [2021-12-15 14:05:17,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=805, Unknown=11, NotChecked=390, Total=1406 [2021-12-15 14:05:17,370 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 95 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 970 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:17,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1029 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 456 Invalid, 0 Unknown, 970 Unchecked, 0.2s Time] [2021-12-15 14:05:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-12-15 14:05:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 370. [2021-12-15 14:05:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 349 states have (on average 1.2435530085959885) internal successors, (434), 369 states have internal predecessors, (434), 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:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 434 transitions. [2021-12-15 14:05:17,374 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 434 transitions. Word has length 40 [2021-12-15 14:05:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:17,374 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 434 transitions. [2021-12-15 14:05:17,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 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:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 434 transitions. [2021-12-15 14:05:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:05:17,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:17,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:17,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:17,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-15 14:05:17,584 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:17,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:17,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1739978080, now seen corresponding path program 1 times [2021-12-15 14:05:17,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:17,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955309312] [2021-12-15 14:05:17,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:17,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:05:17,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:17,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955309312] [2021-12-15 14:05:17,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955309312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:05:17,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:05:17,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-15 14:05:17,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002497222] [2021-12-15 14:05:17,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:05:17,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 14:05:17,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:17,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 14:05:17,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-15 14:05:17,686 INFO L87 Difference]: Start difference. First operand 370 states and 434 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:17,941 INFO L93 Difference]: Finished difference Result 394 states and 457 transitions. [2021-12-15 14:05:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 14:05:17,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 42 [2021-12-15 14:05:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:17,942 INFO L225 Difference]: With dead ends: 394 [2021-12-15 14:05:17,942 INFO L226 Difference]: Without dead ends: 389 [2021-12-15 14:05:17,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-12-15 14:05:17,943 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 180 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:17,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 368 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 14:05:17,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2021-12-15 14:05:17,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 361. [2021-12-15 14:05:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 340 states have (on average 1.2470588235294118) internal successors, (424), 360 states have internal predecessors, (424), 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:17,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 424 transitions. [2021-12-15 14:05:17,949 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 424 transitions. Word has length 42 [2021-12-15 14:05:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:17,950 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 424 transitions. [2021-12-15 14:05:17,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 424 transitions. [2021-12-15 14:05:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:05:17,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:17,951 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:17,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-15 14:05:17,951 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:17,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash 25746790, now seen corresponding path program 1 times [2021-12-15 14:05:17,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:17,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867966988] [2021-12-15 14:05:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:17,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:18,199 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:18,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:18,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867966988] [2021-12-15 14:05:18,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867966988] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:18,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404832536] [2021-12-15 14:05:18,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:18,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:18,202 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:18,230 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:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:18,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 14:05:18,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:18,352 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:18,374 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:05:18,375 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:18,395 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 13 treesize of output 9 [2021-12-15 14:05:18,422 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:18,422 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 34 treesize of output 35 [2021-12-15 14:05:18,479 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-15 14:05:18,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-15 14:05:18,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:18,509 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 43 treesize of output 30 [2021-12-15 14:05:18,617 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:18,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 49 [2021-12-15 14:05:18,755 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:18,755 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 57 treesize of output 49 [2021-12-15 14:05:18,824 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:18,825 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 57 treesize of output 49 [2021-12-15 14:05:18,849 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:18,849 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 54 treesize of output 49 [2021-12-15 14:05:19,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:19,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2021-12-15 14:05:19,120 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:19,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:19,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1779) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:19,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1776 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1776))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1779)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:19,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1776 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1776))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1779)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:19,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1776 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1776))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1779)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:19,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int) (v_ArrVal_1773 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1773) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1776))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1779)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2021-12-15 14:05:19,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int) (v_ArrVal_1773 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_102|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1773) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_102| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1776))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_102|) v_ArrVal_1779)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2021-12-15 14:05:19,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1779 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_23| Int) (v_ArrVal_1772 (Array Int Int)) (v_ArrVal_1773 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_102| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_102|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1773) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1772))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_102| |v_ULTIMATE.start_main_#t~malloc7#1.base_23|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_23| v_ArrVal_1776))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_102|) v_ArrVal_1779)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2021-12-15 14:05:19,413 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:19,413 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 95 treesize of output 66 [2021-12-15 14:05:19,415 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:19,432 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 96 treesize of output 92 [2021-12-15 14:05:19,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:19,435 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 38 treesize of output 34 [2021-12-15 14:05:19,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:19,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2021-12-15 14:05:19,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2021-12-15 14:05:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:05:19,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404832536] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:19,655 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:19,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 38 [2021-12-15 14:05:19,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104869350] [2021-12-15 14:05:19,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:19,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-15 14:05:19,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:19,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-15 14:05:19,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=803, Unknown=32, NotChecked=462, Total=1482 [2021-12-15 14:05:19,660 INFO L87 Difference]: Start difference. First operand 361 states and 424 transitions. Second operand has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 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:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:22,578 INFO L93 Difference]: Finished difference Result 478 states and 554 transitions. [2021-12-15 14:05:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-15 14:05:22,579 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 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 42 [2021-12-15 14:05:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:22,580 INFO L225 Difference]: With dead ends: 478 [2021-12-15 14:05:22,580 INFO L226 Difference]: Without dead ends: 478 [2021-12-15 14:05:22,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=487, Invalid=2158, Unknown=35, NotChecked=742, Total=3422 [2021-12-15 14:05:22,582 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 165 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1489 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:22,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 1408 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 652 Invalid, 0 Unknown, 1489 Unchecked, 0.3s Time] [2021-12-15 14:05:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-12-15 14:05:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 387. [2021-12-15 14:05:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 366 states have (on average 1.2459016393442623) internal successors, (456), 386 states have internal predecessors, (456), 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:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 456 transitions. [2021-12-15 14:05:22,588 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 456 transitions. Word has length 42 [2021-12-15 14:05:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:22,588 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 456 transitions. [2021-12-15 14:05:22,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 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:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 456 transitions. [2021-12-15 14:05:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:05:22,590 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:22,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:22,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:22,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-15 14:05:22,805 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:22,806 INFO L85 PathProgramCache]: Analyzing trace with hash 25746791, now seen corresponding path program 1 times [2021-12-15 14:05:22,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:22,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905868620] [2021-12-15 14:05:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:22,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:23,074 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:23,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:23,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905868620] [2021-12-15 14:05:23,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905868620] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:23,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254844704] [2021-12-15 14:05:23,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:23,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:23,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:23,077 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:05:23,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 14:05:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:23,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-15 14:05:23,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:23,260 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:23,291 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:05:23,292 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:23,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-15 14:05:23,332 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 13 treesize of output 9 [2021-12-15 14:05:23,340 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:23,428 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:23,429 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 57 treesize of output 54 [2021-12-15 14:05:23,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 14:05:23,526 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-15 14:05:23,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2021-12-15 14:05:23,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 14:05:23,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:23,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2021-12-15 14:05:23,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:23,589 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:23,697 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:23,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 57 [2021-12-15 14:05:23,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-15 14:05:23,856 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:23,857 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 57 treesize of output 49 [2021-12-15 14:05:23,874 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:23,875 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 16 treesize of output 22 [2021-12-15 14:05:23,882 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:23,952 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-15 14:05:23,965 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:05:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-15 14:05:23,968 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:24,018 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:24,019 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 64 treesize of output 57 [2021-12-15 14:05:24,022 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 20 treesize of output 22 [2021-12-15 14:05:24,208 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:24,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:24,211 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:24,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2021-12-15 14:05:24,213 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:24,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:24,313 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1932 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-15 14:05:24,335 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) (forall ((v_ArrVal_1932 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-15 14:05:24,341 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1932 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1933) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2021-12-15 14:05:24,352 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1926) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1927) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1927))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1926) .cse0 v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1933) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))))) is different from false [2021-12-15 14:05:24,360 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1926) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1927) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1932)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1927))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1926) .cse2 v_ArrVal_1932) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 4) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1933) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)))))))) is different from false [2021-12-15 14:05:27,136 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:27,136 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 275 treesize of output 246 [2021-12-15 14:05:27,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:27,140 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 848 treesize of output 842 [2021-12-15 14:05:27,147 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:27,147 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 842 treesize of output 532 [2021-12-15 14:05:27,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 446 treesize of output 436 [2021-12-15 14:05:27,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:27,172 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 424 treesize of output 404 [2021-12-15 14:05:27,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:27,192 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 395 treesize of output 379 [2021-12-15 14:05:27,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:27,197 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 358 treesize of output 342 [2021-12-15 14:05:27,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:27,201 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 336 treesize of output 328 [2021-12-15 14:05:27,205 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 328 treesize of output 312 [2021-12-15 14:05:27,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:27,209 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 309 treesize of output 305 [2021-12-15 14:05:27,213 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 305 treesize of output 297 [2021-12-15 14:05:27,348 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:27,475 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:27,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254844704] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:27,476 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:27,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 42 [2021-12-15 14:05:27,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711893068] [2021-12-15 14:05:27,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:27,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-15 14:05:27,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-15 14:05:27,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1194, Unknown=32, NotChecked=380, Total=1806 [2021-12-15 14:05:27,478 INFO L87 Difference]: Start difference. First operand 387 states and 456 transitions. Second operand has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 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:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:28,576 INFO L93 Difference]: Finished difference Result 478 states and 561 transitions. [2021-12-15 14:05:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-15 14:05:28,576 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 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 42 [2021-12-15 14:05:28,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:28,578 INFO L225 Difference]: With dead ends: 478 [2021-12-15 14:05:28,578 INFO L226 Difference]: Without dead ends: 478 [2021-12-15 14:05:28,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=403, Invalid=2444, Unknown=35, NotChecked=540, Total=3422 [2021-12-15 14:05:28,579 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 274 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1232 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:28,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 1217 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 582 Invalid, 0 Unknown, 1232 Unchecked, 0.4s Time] [2021-12-15 14:05:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-12-15 14:05:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 387. [2021-12-15 14:05:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 366 states have (on average 1.2431693989071038) internal successors, (455), 386 states have internal predecessors, (455), 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:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 455 transitions. [2021-12-15 14:05:28,583 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 455 transitions. Word has length 42 [2021-12-15 14:05:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:28,583 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 455 transitions. [2021-12-15 14:05:28,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 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:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 455 transitions. [2021-12-15 14:05:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:05:28,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:28,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:28,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 14:05:28,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-15 14:05:28,794 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-15 14:05:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:05:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash -337548450, now seen corresponding path program 1 times [2021-12-15 14:05:28,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:05:28,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530904044] [2021-12-15 14:05:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:28,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:05:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:29,054 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:29,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:05:29,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530904044] [2021-12-15 14:05:29,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530904044] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:05:29,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176902270] [2021-12-15 14:05:29,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:05:29,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:05:29,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:05:29,056 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 14:05:29,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 14:05:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:05:29,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-15 14:05:29,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:05:29,204 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:29,240 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:05:29,241 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:29,270 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 13 treesize of output 9 [2021-12-15 14:05:29,312 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:29,313 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 34 treesize of output 35 [2021-12-15 14:05:29,401 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-15 14:05:29,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-15 14:05:29,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:29,464 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 43 treesize of output 30 [2021-12-15 14:05:29,562 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:29,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 49 [2021-12-15 14:05:29,715 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:29,715 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 57 treesize of output 49 [2021-12-15 14:05:29,794 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:29,794 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 57 treesize of output 49 [2021-12-15 14:05:29,822 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 14:05:29,823 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 54 treesize of output 49 [2021-12-15 14:05:30,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 14:05:30,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2021-12-15 14:05:30,137 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:30,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:05:30,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2074 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2077)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:30,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2074 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2077)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:30,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2077 (Array Int Int)) (v_ArrVal_2074 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2077)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-15 14:05:30,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2077 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2074 (Array Int Int)) (v_ArrVal_2071 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2071) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2077)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2021-12-15 14:05:30,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2077 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2074 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_112| Int) (v_ArrVal_2071 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2071) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_112| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_112|) v_ArrVal_2077)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_112|))) is different from false [2021-12-15 14:05:30,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2077 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2074 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_112| Int) (v_ArrVal_2071 Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_112|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2071) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2070))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_112| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_112|) v_ArrVal_2077)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2021-12-15 14:05:30,520 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:05:30,520 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 95 treesize of output 66 [2021-12-15 14:05:30,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:30,525 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 96 treesize of output 92 [2021-12-15 14:05:30,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:30,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2021-12-15 14:05:30,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 14:05:30,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2021-12-15 14:05:30,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 70 treesize of output 62 [2021-12-15 14:05:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:05:30,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176902270] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:05:30,748 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:05:30,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 38 [2021-12-15 14:05:30,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047924486] [2021-12-15 14:05:30,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:05:30,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-15 14:05:30,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:05:30,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-15 14:05:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=847, Unknown=47, NotChecked=402, Total=1482 [2021-12-15 14:05:30,751 INFO L87 Difference]: Start difference. First operand 387 states and 455 transitions. Second operand has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 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,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:05:34,150 INFO L93 Difference]: Finished difference Result 827 states and 983 transitions. [2021-12-15 14:05:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-15 14:05:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 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 42 [2021-12-15 14:05:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:05:34,153 INFO L225 Difference]: With dead ends: 827 [2021-12-15 14:05:34,153 INFO L226 Difference]: Without dead ends: 827 [2021-12-15 14:05:34,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 68 SyntacticMatches, 13 SemanticMatches, 70 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=757, Invalid=3493, Unknown=64, NotChecked=798, Total=5112 [2021-12-15 14:05:34,154 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 848 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2232 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 14:05:34,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [848 Valid, 1340 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 673 Invalid, 0 Unknown, 2232 Unchecked, 0.4s Time] [2021-12-15 14:05:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-12-15 14:05:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 402. [2021-12-15 14:05:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 381 states have (on average 1.2440944881889764) internal successors, (474), 401 states have internal predecessors, (474), 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,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 474 transitions. [2021-12-15 14:05:34,162 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 474 transitions. Word has length 42 [2021-12-15 14:05:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:05:34,162 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 474 transitions. [2021-12-15 14:05:34,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.763157894736842) internal successors, (105), 39 states have internal predecessors, (105), 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,163 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 474 transitions. [2021-12-15 14:05:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 14:05:34,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:05:34,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:05:34,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0