./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-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 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:17:24,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:17:24,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:17:24,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:17:24,443 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:17:24,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:17:24,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:17:24,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:17:24,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:17:24,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:17:24,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:17:24,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:17:24,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:17:24,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:17:24,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:17:24,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:17:24,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:17:24,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:17:24,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:17:24,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:17:24,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:17:24,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:17:24,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:17:24,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:17:24,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:17:24,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:17:24,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:17:24,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:17:24,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:17:24,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:17:24,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:17:24,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:17:24,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:17:24,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:17:24,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:17:24,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:17:24,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:17:24,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:17:24,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:17:24,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:17:24,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:17:24,483 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:17:24,506 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:17:24,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:17:24,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:17:24,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:17:24,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:17:24,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:17:24,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:17:24,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:17:24,508 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:17:24,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:17:24,509 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:17:24,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:17:24,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:17:24,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:17:24,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:17:24,509 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:17:24,510 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:17:24,510 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:17:24,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:17:24,510 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:17:24,510 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:17:24,510 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:17:24,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:17:24,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:17:24,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:17:24,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:17:24,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:17:24,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:17:24,511 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:17:24,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:17:24,512 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:17:24,512 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:17:24,512 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:17:24,512 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:17:24,512 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 8b0f1d623fff7bbdf74e6250d2f53fb98e44ca7ba1aae1265f5b0871b427fba0 [2023-02-15 22:17:24,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:17:24,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:17:24,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:17:24,716 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:17:24,716 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:17:24,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-1.i [2023-02-15 22:17:25,641 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:17:25,858 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:17:25,859 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i [2023-02-15 22:17:25,867 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa08c5937/57339ac9c2df4ec4b07368f863cc8756/FLAG53669bf6f [2023-02-15 22:17:25,876 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa08c5937/57339ac9c2df4ec4b07368f863cc8756 [2023-02-15 22:17:25,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:17:25,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:17:25,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:17:25,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:17:25,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:17:25,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:17:25" (1/1) ... [2023-02-15 22:17:25,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749a90fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:25, skipping insertion in model container [2023-02-15 22:17:25,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:17:25" (1/1) ... [2023-02-15 22:17:25,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:17:25,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:17:26,067 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2023-02-15 22:17:26,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:17:26,078 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:17:26,101 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-1.i[22688,22701] [2023-02-15 22:17:26,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:17:26,118 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:17:26,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26 WrapperNode [2023-02-15 22:17:26,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:17:26,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:17:26,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:17:26,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:17:26,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,146 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2023-02-15 22:17:26,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:17:26,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:17:26,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:17:26,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:17:26,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,163 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:17:26,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:17:26,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:17:26,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:17:26,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (1/1) ... [2023-02-15 22:17:26,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:17:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:17:26,202 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) [2023-02-15 22:17:26,217 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 [2023-02-15 22:17:26,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:17:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:17:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:17:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:17:26,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:17:26,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:17:26,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:17:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:17:26,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:17:26,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:17:26,325 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:17:26,327 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:17:26,672 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:17:26,677 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:17:26,678 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 22:17:26,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:17:26 BoogieIcfgContainer [2023-02-15 22:17:26,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:17:26,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:17:26,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:17:26,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:17:26,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:17:25" (1/3) ... [2023-02-15 22:17:26,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db6b18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:17:26, skipping insertion in model container [2023-02-15 22:17:26,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:17:26" (2/3) ... [2023-02-15 22:17:26,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db6b18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:17:26, skipping insertion in model container [2023-02-15 22:17:26,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:17:26" (3/3) ... [2023-02-15 22:17:26,687 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-optional-1.i [2023-02-15 22:17:26,699 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:17:26,699 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2023-02-15 22:17:26,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:17:26,750 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e02de7c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:17:26,751 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-02-15 22:17:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 142 states have internal predecessors, (159), 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) [2023-02-15 22:17:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:17:26,760 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:26,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:17:26,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:26,766 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 22:17:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:26,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753737025] [2023-02-15 22:17:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:26,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:26,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753737025] [2023-02-15 22:17:26,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753737025] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:26,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:26,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:17:26,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768679259] [2023-02-15 22:17:26,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:26,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:17:26,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:26,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:17:26,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:26,999 INFO L87 Difference]: Start difference. First operand has 143 states, 76 states have (on average 2.0921052631578947) internal successors, (159), 142 states have internal predecessors, (159), 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) [2023-02-15 22:17:27,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:27,161 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2023-02-15 22:17:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:17:27,164 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 [2023-02-15 22:17:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:27,173 INFO L225 Difference]: With dead ends: 145 [2023-02-15 22:17:27,173 INFO L226 Difference]: Without dead ends: 141 [2023-02-15 22:17:27,175 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:27,177 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:27,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 84 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-15 22:17:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2023-02-15 22:17:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.8846153846153846) 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) [2023-02-15 22:17:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-02-15 22:17:27,205 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2023-02-15 22:17:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:27,206 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-02-15 22:17:27,206 INFO L496 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) [2023-02-15 22:17:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-02-15 22:17:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:17:27,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:27,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:17:27,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:17:27,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 22:17:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:27,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066985811] [2023-02-15 22:17:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:27,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:27,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066985811] [2023-02-15 22:17:27,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066985811] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:27,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:27,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:17:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85897869] [2023-02-15 22:17:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:27,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:17:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:27,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:17:27,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:27,273 INFO L87 Difference]: Start difference. First operand 135 states and 147 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) [2023-02-15 22:17:27,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:27,360 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2023-02-15 22:17:27,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:17:27,361 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 [2023-02-15 22:17:27,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:27,362 INFO L225 Difference]: With dead ends: 131 [2023-02-15 22:17:27,362 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 22:17:27,362 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:27,363 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 105 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:27,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 97 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 22:17:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-02-15 22:17:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.7820512820512822) internal successors, (139), 126 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2023-02-15 22:17:27,384 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 3 [2023-02-15 22:17:27,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:27,384 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2023-02-15 22:17:27,384 INFO L496 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) [2023-02-15 22:17:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2023-02-15 22:17:27,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:17:27,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:27,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:27,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:17:27,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash 171916845, now seen corresponding path program 1 times [2023-02-15 22:17:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:27,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846827053] [2023-02-15 22:17:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:27,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846827053] [2023-02-15 22:17:27,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846827053] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:27,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:27,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:17:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849488697] [2023-02-15 22:17:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:27,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:17:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:27,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:17:27,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:17:27,569 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-02-15 22:17:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:27,706 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2023-02-15 22:17:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:17:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2023-02-15 22:17:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:27,708 INFO L225 Difference]: With dead ends: 171 [2023-02-15 22:17:27,708 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 22:17:27,708 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:27,709 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 52 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:27,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 313 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 22:17:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2023-02-15 22:17:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 125 states have internal predecessors, (138), 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) [2023-02-15 22:17:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2023-02-15 22:17:27,715 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 11 [2023-02-15 22:17:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:27,715 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2023-02-15 22:17:27,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-02-15 22:17:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2023-02-15 22:17:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:17:27,716 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:27,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:27,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:17:27,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash 171916846, now seen corresponding path program 1 times [2023-02-15 22:17:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:27,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046071612] [2023-02-15 22:17:27,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:27,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:27,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:27,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046071612] [2023-02-15 22:17:27,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046071612] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:27,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:27,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:17:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96504708] [2023-02-15 22:17:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:27,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:17:27,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:27,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:17:27,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:17:27,841 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-02-15 22:17:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:27,970 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2023-02-15 22:17:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:17:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2023-02-15 22:17:27,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:27,972 INFO L225 Difference]: With dead ends: 125 [2023-02-15 22:17:27,972 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 22:17:27,972 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:27,973 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:27,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 349 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 22:17:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-02-15 22:17:27,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.7564102564102564) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2023-02-15 22:17:27,983 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 11 [2023-02-15 22:17:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:27,984 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2023-02-15 22:17:27,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-02-15 22:17:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2023-02-15 22:17:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:17:27,985 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:27,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:27,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:17:27,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -468215045, now seen corresponding path program 1 times [2023-02-15 22:17:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:27,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179826538] [2023-02-15 22:17:27,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:28,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179826538] [2023-02-15 22:17:28,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179826538] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:28,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:28,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:17:28,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571976513] [2023-02-15 22:17:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:28,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:17:28,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:28,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:17:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:17:28,054 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2023-02-15 22:17:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:28,174 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2023-02-15 22:17:28,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:17:28,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 [2023-02-15 22:17:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:28,176 INFO L225 Difference]: With dead ends: 127 [2023-02-15 22:17:28,176 INFO L226 Difference]: Without dead ends: 127 [2023-02-15 22:17:28,176 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:28,177 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 174 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:28,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 73 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-15 22:17:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2023-02-15 22:17:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 117 states have internal predecessors, (135), 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) [2023-02-15 22:17:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 135 transitions. [2023-02-15 22:17:28,181 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 135 transitions. Word has length 12 [2023-02-15 22:17:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:28,181 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 135 transitions. [2023-02-15 22:17:28,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2023-02-15 22:17:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2023-02-15 22:17:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:17:28,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:28,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:28,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:17:28,183 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:28,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:28,183 INFO L85 PathProgramCache]: Analyzing trace with hash -468215044, now seen corresponding path program 1 times [2023-02-15 22:17:28,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:28,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056668021] [2023-02-15 22:17:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:28,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:28,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:28,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056668021] [2023-02-15 22:17:28,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056668021] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:28,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:28,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:17:28,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366881553] [2023-02-15 22:17:28,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:28,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:17:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:28,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:17:28,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:17:28,283 INFO L87 Difference]: Start difference. First operand 118 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:28,466 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2023-02-15 22:17:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:17:28,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 22:17:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:28,468 INFO L225 Difference]: With dead ends: 171 [2023-02-15 22:17:28,468 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 22:17:28,468 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:28,468 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 178 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:28,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 151 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:17:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 22:17:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2023-02-15 22:17:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 145 states have internal predecessors, (171), 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) [2023-02-15 22:17:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2023-02-15 22:17:28,472 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 12 [2023-02-15 22:17:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:28,472 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2023-02-15 22:17:28,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2023-02-15 22:17:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:17:28,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:28,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:28,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:17:28,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220227, now seen corresponding path program 1 times [2023-02-15 22:17:28,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:28,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016177018] [2023-02-15 22:17:28,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:28,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:28,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:28,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016177018] [2023-02-15 22:17:28,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016177018] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:28,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:28,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:17:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454949196] [2023-02-15 22:17:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:28,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:17:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:28,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:17:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:17:28,550 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2023-02-15 22:17:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:28,711 INFO L93 Difference]: Finished difference Result 146 states and 171 transitions. [2023-02-15 22:17:28,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:17:28,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 [2023-02-15 22:17:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:28,713 INFO L225 Difference]: With dead ends: 146 [2023-02-15 22:17:28,713 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 22:17:28,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:17:28,714 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 63 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:28,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 273 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 22:17:28,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2023-02-15 22:17:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 144 states have internal predecessors, (170), 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) [2023-02-15 22:17:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 170 transitions. [2023-02-15 22:17:28,717 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 170 transitions. Word has length 16 [2023-02-15 22:17:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:28,718 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 170 transitions. [2023-02-15 22:17:28,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2023-02-15 22:17:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 170 transitions. [2023-02-15 22:17:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:17:28,718 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:28,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:28,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:17:28,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:28,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220226, now seen corresponding path program 1 times [2023-02-15 22:17:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:28,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19168406] [2023-02-15 22:17:28,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:28,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:28,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:28,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19168406] [2023-02-15 22:17:28,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19168406] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:28,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:28,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:17:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589951724] [2023-02-15 22:17:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:28,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:17:28,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:28,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:17:28,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:17:28,831 INFO L87 Difference]: Start difference. First operand 145 states and 170 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2023-02-15 22:17:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:29,021 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2023-02-15 22:17:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:17:29,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 [2023-02-15 22:17:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:29,022 INFO L225 Difference]: With dead ends: 137 [2023-02-15 22:17:29,022 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 22:17:29,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:17:29,023 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 25 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:29,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 323 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 22:17:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2023-02-15 22:17:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.439252336448598) internal successors, (154), 129 states have internal predecessors, (154), 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) [2023-02-15 22:17:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2023-02-15 22:17:29,025 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 16 [2023-02-15 22:17:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:29,026 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2023-02-15 22:17:29,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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) [2023-02-15 22:17:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2023-02-15 22:17:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:17:29,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:29,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:29,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:17:29,026 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:29,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:29,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2123452236, now seen corresponding path program 1 times [2023-02-15 22:17:29,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:29,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050458170] [2023-02-15 22:17:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:29,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:29,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:29,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050458170] [2023-02-15 22:17:29,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050458170] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:29,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:29,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:17:29,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379675332] [2023-02-15 22:17:29,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:29,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:17:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:29,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:17:29,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:17:29,057 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-02-15 22:17:29,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:29,129 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2023-02-15 22:17:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:17:29,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2023-02-15 22:17:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:29,130 INFO L225 Difference]: With dead ends: 154 [2023-02-15 22:17:29,130 INFO L226 Difference]: Without dead ends: 154 [2023-02-15 22:17:29,130 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:29,131 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 121 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:29,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 151 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-15 22:17:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 130. [2023-02-15 22:17:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.4205607476635513) internal successors, (152), 129 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2023-02-15 22:17:29,134 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 17 [2023-02-15 22:17:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:29,134 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2023-02-15 22:17:29,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-02-15 22:17:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2023-02-15 22:17:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 22:17:29,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:29,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:29,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:17:29,135 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1866791259, now seen corresponding path program 1 times [2023-02-15 22:17:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:29,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696635494] [2023-02-15 22:17:29,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:29,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:29,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:29,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696635494] [2023-02-15 22:17:29,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696635494] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:29,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:29,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:17:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637729931] [2023-02-15 22:17:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:29,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:17:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:17:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:17:29,162 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2023-02-15 22:17:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:29,178 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2023-02-15 22:17:29,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:17:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 [2023-02-15 22:17:29,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:29,179 INFO L225 Difference]: With dead ends: 156 [2023-02-15 22:17:29,179 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 22:17:29,180 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:29,180 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 21 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 304 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 [2023-02-15 22:17:29,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 304 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:17:29,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 22:17:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2023-02-15 22:17:29,182 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) [2023-02-15 22:17:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2023-02-15 22:17:29,183 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2023-02-15 22:17:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:29,183 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2023-02-15 22:17:29,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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) [2023-02-15 22:17:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2023-02-15 22:17:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:17:29,184 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:29,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:29,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:17:29,184 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash 72886850, now seen corresponding path program 1 times [2023-02-15 22:17:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:29,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711494020] [2023-02-15 22:17:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:29,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:29,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711494020] [2023-02-15 22:17:29,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711494020] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:29,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:29,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:17:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586272600] [2023-02-15 22:17:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:29,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:17:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:17:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:17:29,277 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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) [2023-02-15 22:17:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:29,586 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions. [2023-02-15 22:17:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:17:29,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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 22 [2023-02-15 22:17:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:29,588 INFO L225 Difference]: With dead ends: 247 [2023-02-15 22:17:29,588 INFO L226 Difference]: Without dead ends: 247 [2023-02-15 22:17:29,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:17:29,589 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 266 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:29,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 373 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:17:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-15 22:17:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 148. [2023-02-15 22:17:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 125 states have (on average 1.392) internal successors, (174), 147 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) [2023-02-15 22:17:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 174 transitions. [2023-02-15 22:17:29,592 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 174 transitions. Word has length 22 [2023-02-15 22:17:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:29,592 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 174 transitions. [2023-02-15 22:17:29,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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) [2023-02-15 22:17:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 174 transitions. [2023-02-15 22:17:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:17:29,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:29,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:29,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:17:29,594 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash 72886851, now seen corresponding path program 1 times [2023-02-15 22:17:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:29,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171513145] [2023-02-15 22:17:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:29,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:29,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171513145] [2023-02-15 22:17:29,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171513145] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:29,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:29,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:17:29,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078296669] [2023-02-15 22:17:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:29,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:17:29,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:29,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:17:29,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:17:29,757 INFO L87 Difference]: Start difference. First operand 148 states and 174 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2023-02-15 22:17:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:30,021 INFO L93 Difference]: Finished difference Result 224 states and 257 transitions. [2023-02-15 22:17:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:17:30,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 22 [2023-02-15 22:17:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:30,022 INFO L225 Difference]: With dead ends: 224 [2023-02-15 22:17:30,022 INFO L226 Difference]: Without dead ends: 224 [2023-02-15 22:17:30,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:17:30,023 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 257 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:30,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 390 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:17:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-15 22:17:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 144. [2023-02-15 22:17:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 143 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2023-02-15 22:17:30,025 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 22 [2023-02-15 22:17:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:30,026 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2023-02-15 22:17:30,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2023-02-15 22:17:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2023-02-15 22:17:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:17:30,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:30,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:17:30,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:17:30,026 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1318553294, now seen corresponding path program 1 times [2023-02-15 22:17:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:30,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363782285] [2023-02-15 22:17:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:30,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:30,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:30,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:30,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363782285] [2023-02-15 22:17:30,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363782285] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:30,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:30,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:17:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278012387] [2023-02-15 22:17:30,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:30,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:17:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:30,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:17:30,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:17:30,045 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-02-15 22:17:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:30,051 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2023-02-15 22:17:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:17:30,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2023-02-15 22:17:30,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:30,052 INFO L225 Difference]: With dead ends: 146 [2023-02-15 22:17:30,052 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 22:17:30,052 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:30,053 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 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 [2023-02-15 22:17:30,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:17:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 22:17:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2023-02-15 22:17:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 145 states have internal predecessors, (170), 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) [2023-02-15 22:17:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2023-02-15 22:17:30,055 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 22 [2023-02-15 22:17:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:30,056 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2023-02-15 22:17:30,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2023-02-15 22:17:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2023-02-15 22:17:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:17:30,057 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:30,057 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:30,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:17:30,057 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash 116002131, now seen corresponding path program 1 times [2023-02-15 22:17:30,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:30,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488392369] [2023-02-15 22:17:30,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:30,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:30,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:30,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:30,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488392369] [2023-02-15 22:17:30,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488392369] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:30,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:30,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:17:30,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786089120] [2023-02-15 22:17:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:30,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:17:30,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:17:30,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:17:30,174 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2023-02-15 22:17:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:30,392 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2023-02-15 22:17:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:17:30,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2023-02-15 22:17:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:30,393 INFO L225 Difference]: With dead ends: 219 [2023-02-15 22:17:30,393 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 22:17:30,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:17:30,394 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 229 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:30,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 353 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 22:17:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 152. [2023-02-15 22:17:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.372093023255814) internal successors, (177), 151 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) [2023-02-15 22:17:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2023-02-15 22:17:30,397 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 24 [2023-02-15 22:17:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:30,398 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2023-02-15 22:17:30,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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) [2023-02-15 22:17:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2023-02-15 22:17:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:17:30,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:30,398 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:30,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:17:30,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:30,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash 913286409, now seen corresponding path program 1 times [2023-02-15 22:17:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:30,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708517633] [2023-02-15 22:17:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:30,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:30,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:30,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708517633] [2023-02-15 22:17:30,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708517633] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:30,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:30,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:17:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104636663] [2023-02-15 22:17:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:30,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:17:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:30,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:17:30,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:17:30,466 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-02-15 22:17:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:30,572 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2023-02-15 22:17:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:17:30,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2023-02-15 22:17:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:30,574 INFO L225 Difference]: With dead ends: 158 [2023-02-15 22:17:30,574 INFO L226 Difference]: Without dead ends: 158 [2023-02-15 22:17:30,574 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:30,574 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:30,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 286 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-15 22:17:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2023-02-15 22:17:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 150 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) [2023-02-15 22:17:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2023-02-15 22:17:30,577 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 24 [2023-02-15 22:17:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:30,577 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2023-02-15 22:17:30,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-02-15 22:17:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2023-02-15 22:17:30,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:17:30,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:30,578 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:30,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:17:30,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash 913286410, now seen corresponding path program 1 times [2023-02-15 22:17:30,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:30,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069597659] [2023-02-15 22:17:30,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:30,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:30,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069597659] [2023-02-15 22:17:30,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069597659] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:30,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:30,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:17:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684855312] [2023-02-15 22:17:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:30,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:17:30,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:30,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:17:30,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:17:30,697 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-02-15 22:17:30,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:30,797 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2023-02-15 22:17:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:17:30,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2023-02-15 22:17:30,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:30,798 INFO L225 Difference]: With dead ends: 150 [2023-02-15 22:17:30,798 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 22:17:30,798 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:30,799 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:30,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 275 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 22:17:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-02-15 22:17:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 149 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:30,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2023-02-15 22:17:30,801 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 24 [2023-02-15 22:17:30,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:30,801 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2023-02-15 22:17:30,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-02-15 22:17:30,802 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2023-02-15 22:17:30,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:17:30,802 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:30,802 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:30,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 22:17:30,803 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177146, now seen corresponding path program 1 times [2023-02-15 22:17:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:30,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70119649] [2023-02-15 22:17:30,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:30,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70119649] [2023-02-15 22:17:30,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70119649] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:30,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:30,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:17:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333428324] [2023-02-15 22:17:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:30,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:17:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:17:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:17:30,945 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:31,298 INFO L93 Difference]: Finished difference Result 309 states and 356 transitions. [2023-02-15 22:17:31,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:17:31,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 22:17:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:31,299 INFO L225 Difference]: With dead ends: 309 [2023-02-15 22:17:31,299 INFO L226 Difference]: Without dead ends: 309 [2023-02-15 22:17:31,300 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:31,300 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 343 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:31,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 466 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:17:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-02-15 22:17:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 163. [2023-02-15 22:17:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.352112676056338) internal successors, (192), 162 states have internal predecessors, (192), 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) [2023-02-15 22:17:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 192 transitions. [2023-02-15 22:17:31,303 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 192 transitions. Word has length 26 [2023-02-15 22:17:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:31,304 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 192 transitions. [2023-02-15 22:17:31,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 192 transitions. [2023-02-15 22:17:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:17:31,305 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:31,305 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:31,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:17:31,306 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1848177147, now seen corresponding path program 1 times [2023-02-15 22:17:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:31,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106337157] [2023-02-15 22:17:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:31,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:31,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106337157] [2023-02-15 22:17:31,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106337157] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:31,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:31,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:17:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457836036] [2023-02-15 22:17:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:31,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:17:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:31,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:17:31,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:17:31,603 INFO L87 Difference]: Start difference. First operand 163 states and 192 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:32,052 INFO L93 Difference]: Finished difference Result 252 states and 290 transitions. [2023-02-15 22:17:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:17:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 22:17:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:32,054 INFO L225 Difference]: With dead ends: 252 [2023-02-15 22:17:32,054 INFO L226 Difference]: Without dead ends: 252 [2023-02-15 22:17:32,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:17:32,055 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 293 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:32,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 579 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:17:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-02-15 22:17:32,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 163. [2023-02-15 22:17:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 162 states have internal predecessors, (191), 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) [2023-02-15 22:17:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 191 transitions. [2023-02-15 22:17:32,058 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 191 transitions. Word has length 26 [2023-02-15 22:17:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:32,058 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 191 transitions. [2023-02-15 22:17:32,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 191 transitions. [2023-02-15 22:17:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 22:17:32,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:32,059 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:32,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 22:17:32,059 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1639700775, now seen corresponding path program 1 times [2023-02-15 22:17:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245207175] [2023-02-15 22:17:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:32,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245207175] [2023-02-15 22:17:32,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245207175] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:32,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:32,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:17:32,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245887088] [2023-02-15 22:17:32,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:32,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:17:32,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:32,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:17:32,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:17:32,115 INFO L87 Difference]: Start difference. First operand 163 states and 191 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:32,128 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2023-02-15 22:17:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:17:32,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 22:17:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:32,129 INFO L225 Difference]: With dead ends: 175 [2023-02-15 22:17:32,129 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 22:17:32,129 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:32,129 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 10 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 299 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 [2023-02-15 22:17:32,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 299 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:17:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 22:17:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2023-02-15 22:17:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 166 states have internal predecessors, (194), 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) [2023-02-15 22:17:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 194 transitions. [2023-02-15 22:17:32,132 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 194 transitions. Word has length 26 [2023-02-15 22:17:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:32,132 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 194 transitions. [2023-02-15 22:17:32,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:17:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 194 transitions. [2023-02-15 22:17:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:17:32,133 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:32,133 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:32,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 22:17:32,133 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1067960075, now seen corresponding path program 1 times [2023-02-15 22:17:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:32,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852012493] [2023-02-15 22:17:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:32,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852012493] [2023-02-15 22:17:32,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852012493] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:32,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:32,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 22:17:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801542930] [2023-02-15 22:17:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:32,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:17:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:17:32,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:17:32,314 INFO L87 Difference]: Start difference. First operand 167 states and 194 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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) [2023-02-15 22:17:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:32,709 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2023-02-15 22:17:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:17:32,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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 [2023-02-15 22:17:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:32,710 INFO L225 Difference]: With dead ends: 247 [2023-02-15 22:17:32,710 INFO L226 Difference]: Without dead ends: 247 [2023-02-15 22:17:32,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:17:32,711 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 277 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:32,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 691 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:17:32,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-15 22:17:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 167. [2023-02-15 22:17:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.321917808219178) internal successors, (193), 166 states have internal predecessors, (193), 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) [2023-02-15 22:17:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2023-02-15 22:17:32,713 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 28 [2023-02-15 22:17:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:32,713 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2023-02-15 22:17:32,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 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) [2023-02-15 22:17:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2023-02-15 22:17:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 22:17:32,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:32,714 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:32,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 22:17:32,714 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:32,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1161159390, now seen corresponding path program 1 times [2023-02-15 22:17:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:32,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194595465] [2023-02-15 22:17:32,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:32,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:32,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:32,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194595465] [2023-02-15 22:17:32,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194595465] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:17:32,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765617340] [2023-02-15 22:17:32,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:32,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:17:32,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:17:32,827 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) [2023-02-15 22:17:32,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:17:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:32,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 22:17:32,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:17:33,041 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:33,045 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:33,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:33,077 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:33,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:33,083 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:33,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:33,094 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:33,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:33,098 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:33,174 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:17:33,175 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:33,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:17:33,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:33,181 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:33,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:17:33,517 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 22:17:33,521 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 12 [2023-02-15 22:17:33,526 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-15 22:17:33,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:33,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765617340] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:17:33,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:17:33,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2023-02-15 22:17:33,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261082839] [2023-02-15 22:17:33,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:17:33,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:17:33,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:17:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:17:33,538 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 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) [2023-02-15 22:17:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:33,772 INFO L93 Difference]: Finished difference Result 208 states and 237 transitions. [2023-02-15 22:17:33,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:17:33,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 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 [2023-02-15 22:17:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:33,773 INFO L225 Difference]: With dead ends: 208 [2023-02-15 22:17:33,773 INFO L226 Difference]: Without dead ends: 208 [2023-02-15 22:17:33,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:17:33,774 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 351 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:33,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 368 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-02-15 22:17:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2023-02-15 22:17:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 159 states have (on average 1.3081761006289307) internal successors, (208), 179 states have internal predecessors, (208), 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) [2023-02-15 22:17:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2023-02-15 22:17:33,776 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 28 [2023-02-15 22:17:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:33,776 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2023-02-15 22:17:33,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 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) [2023-02-15 22:17:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2023-02-15 22:17:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:17:33,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:33,777 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:33,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:17:33,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 22:17:33,988 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1511540264, now seen corresponding path program 1 times [2023-02-15 22:17:33,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:33,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573499257] [2023-02-15 22:17:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:34,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573499257] [2023-02-15 22:17:34,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573499257] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:34,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:34,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:17:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118512030] [2023-02-15 22:17:34,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:34,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:17:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:17:34,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:17:34,082 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2023-02-15 22:17:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:34,239 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2023-02-15 22:17:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:17:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 22:17:34,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:34,241 INFO L225 Difference]: With dead ends: 225 [2023-02-15 22:17:34,241 INFO L226 Difference]: Without dead ends: 225 [2023-02-15 22:17:34,241 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:17:34,241 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 67 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:34,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 433 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:17:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-15 22:17:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 186. [2023-02-15 22:17:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.303030303030303) internal successors, (215), 185 states have internal predecessors, (215), 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) [2023-02-15 22:17:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 215 transitions. [2023-02-15 22:17:34,244 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 215 transitions. Word has length 30 [2023-02-15 22:17:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:34,244 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 215 transitions. [2023-02-15 22:17:34,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2023-02-15 22:17:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 215 transitions. [2023-02-15 22:17:34,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:17:34,244 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:34,245 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:34,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 22:17:34,245 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 238082658, now seen corresponding path program 1 times [2023-02-15 22:17:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:34,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398726136] [2023-02-15 22:17:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:34,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:34,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398726136] [2023-02-15 22:17:34,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398726136] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:17:34,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:17:34,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 22:17:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584332308] [2023-02-15 22:17:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:17:34,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:17:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:34,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:17:34,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:17:34,619 INFO L87 Difference]: Start difference. First operand 186 states and 215 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) [2023-02-15 22:17:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:35,398 INFO L93 Difference]: Finished difference Result 224 states and 252 transitions. [2023-02-15 22:17:35,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 22:17:35,399 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-15 22:17:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:35,399 INFO L225 Difference]: With dead ends: 224 [2023-02-15 22:17:35,400 INFO L226 Difference]: Without dead ends: 224 [2023-02-15 22:17:35,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:17:35,400 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 271 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:35,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 682 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:17:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-15 22:17:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2023-02-15 22:17:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 182 states have internal predecessors, (210), 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) [2023-02-15 22:17:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 210 transitions. [2023-02-15 22:17:35,403 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 210 transitions. Word has length 33 [2023-02-15 22:17:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:35,403 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 210 transitions. [2023-02-15 22:17:35,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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) [2023-02-15 22:17:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 210 transitions. [2023-02-15 22:17:35,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:17:35,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:35,403 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:35,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 22:17:35,404 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash 745727206, now seen corresponding path program 1 times [2023-02-15 22:17:35,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:35,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360523749] [2023-02-15 22:17:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:35,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:35,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:35,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360523749] [2023-02-15 22:17:35,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360523749] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:17:35,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400703892] [2023-02-15 22:17:35,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:35,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:17:35,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:17:35,773 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) [2023-02-15 22:17:35,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:17:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:35,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 22:17:35,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:17:35,895 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:35,913 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:35,950 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:17:35,950 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:35,992 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:17:35,992 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:36,144 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:17:36,145 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 22:17:36,239 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:17:36,239 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 22:17:36,269 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:17:36,271 INFO L350 Elim1Store]: Elim1 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 73 treesize of output 63 [2023-02-15 22:17:36,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:36,521 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 36 [2023-02-15 22:17:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:36,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:17:36,629 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2023-02-15 22:17:38,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_677 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_7| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_7| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_7|))) (not (= 1 (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 (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_7|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_7| v_ArrVal_677) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)))) is different from false [2023-02-15 22:17:38,817 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-15 22:17:38,817 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 36 [2023-02-15 22:17:38,823 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:17:38,823 INFO L350 Elim1Store]: Elim1 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 85 treesize of output 49 [2023-02-15 22:17:38,827 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 8 [2023-02-15 22:17:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:40,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400703892] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:17:40,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:17:40,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2023-02-15 22:17:40,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048916820] [2023-02-15 22:17:40,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:17:40,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 22:17:40,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:17:40,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 22:17:40,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=661, Unknown=15, NotChecked=110, Total=930 [2023-02-15 22:17:40,880 INFO L87 Difference]: Start difference. First operand 183 states and 210 transitions. Second operand has 31 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 31 states have internal predecessors, (94), 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) [2023-02-15 22:17:43,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:17:50,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:17:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:17:55,666 INFO L93 Difference]: Finished difference Result 467 states and 524 transitions. [2023-02-15 22:17:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-15 22:17:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 31 states have internal predecessors, (94), 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 [2023-02-15 22:17:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:17:55,667 INFO L225 Difference]: With dead ends: 467 [2023-02-15 22:17:55,667 INFO L226 Difference]: Without dead ends: 467 [2023-02-15 22:17:55,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=829, Invalid=3284, Unknown=55, NotChecked=254, Total=4422 [2023-02-15 22:17:55,669 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 690 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 89 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 2056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:17:55,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1376 Invalid, 2056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1654 Invalid, 18 Unknown, 295 Unchecked, 5.2s Time] [2023-02-15 22:17:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-02-15 22:17:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 216. [2023-02-15 22:17:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 195 states have (on average 1.2871794871794873) internal successors, (251), 215 states have internal predecessors, (251), 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) [2023-02-15 22:17:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 251 transitions. [2023-02-15 22:17:55,673 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 251 transitions. Word has length 34 [2023-02-15 22:17:55,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:17:55,673 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 251 transitions. [2023-02-15 22:17:55,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.1333333333333333) internal successors, (94), 31 states have internal predecessors, (94), 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) [2023-02-15 22:17:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 251 transitions. [2023-02-15 22:17:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 22:17:55,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:17:55,673 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:17:55,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:17:55,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-15 22:17:55,874 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:17:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:17:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash 745727207, now seen corresponding path program 1 times [2023-02-15 22:17:55,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:17:55,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488654490] [2023-02-15 22:17:55,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:17:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:56,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:17:56,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488654490] [2023-02-15 22:17:56,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488654490] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:17:56,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920919088] [2023-02-15 22:17:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:17:56,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:17:56,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:17:56,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) [2023-02-15 22:17:56,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 [2023-02-15 22:17:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:17:56,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 22:17:56,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:17:56,502 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,531 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,535 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,610 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:17:56,610 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:56,644 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:56,650 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,756 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:17:56,756 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,759 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,770 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:17:56,770 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,840 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:17:56,841 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,857 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:17:56,857 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,862 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,908 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:17:56,909 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:56,913 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:57,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:17:57,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:17:57,060 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:57,064 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:17:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:17:57,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:17:57,198 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 22:17:57,300 WARN L837 $PredicateComparison]: unable to prove that (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| 4))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 22:18:03,582 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:03,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:03,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-02-15 22:18:03,590 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:03,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:18:03,592 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 30 [2023-02-15 22:18:03,596 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:18:03,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:18:03,600 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 22:18:03,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-02-15 22:18:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:18:03,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920919088] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:18:03,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:18:03,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 35 [2023-02-15 22:18:03,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997097347] [2023-02-15 22:18:03,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:18:03,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 22:18:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:18:03,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 22:18:03,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=893, Unknown=23, NotChecked=126, Total=1190 [2023-02-15 22:18:03,635 INFO L87 Difference]: Start difference. First operand 216 states and 251 transitions. Second operand has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 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) [2023-02-15 22:18:05,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:07,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:09,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:11,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:31,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:18:33,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:18:40,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:44,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:46,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:50,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:52,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:18:55,139 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse2) |c_ULTIMATE.start_main_~x~0#1.offset|) (forall ((v_ArrVal_783 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_783) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0)))) is different from false [2023-02-15 22:19:12,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:19:14,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:19:16,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:19:18,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:19:20,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:19:30,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 22:19:30,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:19:30,330 INFO L93 Difference]: Finished difference Result 804 states and 902 transitions. [2023-02-15 22:19:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-02-15 22:19:30,330 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 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 [2023-02-15 22:19:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:19:30,332 INFO L225 Difference]: With dead ends: 804 [2023-02-15 22:19:30,332 INFO L226 Difference]: Without dead ends: 804 [2023-02-15 22:19:30,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 99 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3221 ImplicationChecksByTransitivity, 57.5s TimeCoverageRelationStatistics Valid=1636, Invalid=7807, Unknown=75, NotChecked=582, Total=10100 [2023-02-15 22:19:30,335 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 1537 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 188 mSolverCounterUnsat, 83 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 83 IncrementalHoareTripleChecker+Unknown, 585 IncrementalHoareTripleChecker+Unchecked, 35.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:19:30,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 1635 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 2148 Invalid, 83 Unknown, 585 Unchecked, 35.8s Time] [2023-02-15 22:19:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2023-02-15 22:19:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 269. [2023-02-15 22:19:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 248 states have (on average 1.2741935483870968) internal successors, (316), 268 states have internal predecessors, (316), 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) [2023-02-15 22:19:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 316 transitions. [2023-02-15 22:19:30,340 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 316 transitions. Word has length 34 [2023-02-15 22:19:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:19:30,340 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 316 transitions. [2023-02-15 22:19:30,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.657142857142857) internal successors, (93), 35 states have internal predecessors, (93), 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) [2023-02-15 22:19:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 316 transitions. [2023-02-15 22:19:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:19:30,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:19:30,341 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:19:30,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:19:30,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:19:30,550 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:19:30,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:19:30,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1970599096, now seen corresponding path program 1 times [2023-02-15 22:19:30,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:19:30,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251593789] [2023-02-15 22:19:30,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:30,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:19:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:19:30,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:19:30,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251593789] [2023-02-15 22:19:30,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251593789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:19:30,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:19:30,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:19:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935312316] [2023-02-15 22:19:30,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:19:30,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:19:30,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:19:30,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:19:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:19:30,618 INFO L87 Difference]: Start difference. First operand 269 states and 316 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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) [2023-02-15 22:19:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:19:30,700 INFO L93 Difference]: Finished difference Result 283 states and 324 transitions. [2023-02-15 22:19:30,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:19:30,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 22:19:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:19:30,702 INFO L225 Difference]: With dead ends: 283 [2023-02-15 22:19:30,702 INFO L226 Difference]: Without dead ends: 283 [2023-02-15 22:19:30,702 INFO L412 NwaCegarLoop]: 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 [2023-02-15 22:19:30,702 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 116 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:19:30,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 134 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:19:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-02-15 22:19:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 271. [2023-02-15 22:19:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 250 states have (on average 1.272) internal successors, (318), 270 states have internal predecessors, (318), 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) [2023-02-15 22:19:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 318 transitions. [2023-02-15 22:19:30,717 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 318 transitions. Word has length 35 [2023-02-15 22:19:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:19:30,718 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 318 transitions. [2023-02-15 22:19:30,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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) [2023-02-15 22:19:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 318 transitions. [2023-02-15 22:19:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:19:30,718 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:19:30,718 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:19:30,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 22:19:30,719 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:19:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:19:30,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1970588111, now seen corresponding path program 1 times [2023-02-15 22:19:30,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:19:30,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377405993] [2023-02-15 22:19:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:19:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:19:30,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377405993] [2023-02-15 22:19:30,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377405993] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:19:30,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104186345] [2023-02-15 22:19:30,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:30,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:19:30,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:19:30,920 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) [2023-02-15 22:19:30,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:19:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:31,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 22:19:31,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:19:31,045 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:31,160 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:19:31,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:19:31,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104186345] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:19:31,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:19:31,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2023-02-15 22:19:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542879645] [2023-02-15 22:19:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:19:31,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:19:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:19:31,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:19:31,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:19:31,171 INFO L87 Difference]: Start difference. First operand 271 states and 318 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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) [2023-02-15 22:19:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:19:31,346 INFO L93 Difference]: Finished difference Result 304 states and 352 transitions. [2023-02-15 22:19:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:19:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-15 22:19:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:19:31,348 INFO L225 Difference]: With dead ends: 304 [2023-02-15 22:19:31,348 INFO L226 Difference]: Without dead ends: 304 [2023-02-15 22:19:31,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:19:31,348 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 191 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:19:31,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 305 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:19:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-02-15 22:19:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 288. [2023-02-15 22:19:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 267 states have (on average 1.2584269662921348) internal successors, (336), 287 states have internal predecessors, (336), 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) [2023-02-15 22:19:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 336 transitions. [2023-02-15 22:19:31,351 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 336 transitions. Word has length 35 [2023-02-15 22:19:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:19:31,352 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 336 transitions. [2023-02-15 22:19:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 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) [2023-02-15 22:19:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 336 transitions. [2023-02-15 22:19:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 22:19:31,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:19:31,352 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:19:31,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:19:31,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 22:19:31,558 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:19:31,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:19:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash 958689536, now seen corresponding path program 1 times [2023-02-15 22:19:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:19:31,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906508885] [2023-02-15 22:19:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:31,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:19:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:19:31,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906508885] [2023-02-15 22:19:31,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906508885] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:19:31,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933116522] [2023-02-15 22:19:31,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:31,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:19:31,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:19:31,761 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) [2023-02-15 22:19:31,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:19:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:31,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 22:19:31,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:19:31,887 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:31,901 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:32,022 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:32,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:19:32,278 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 18 [2023-02-15 22:19:32,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-02-15 22:19:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:32,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933116522] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:19:32,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:19:32,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 8] total 22 [2023-02-15 22:19:32,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639489728] [2023-02-15 22:19:32,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:19:32,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:19:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:19:32,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:19:32,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:19:32,302 INFO L87 Difference]: Start difference. First operand 288 states and 336 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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) [2023-02-15 22:19:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:19:32,553 INFO L93 Difference]: Finished difference Result 300 states and 348 transitions. [2023-02-15 22:19:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:19:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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 [2023-02-15 22:19:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:19:32,555 INFO L225 Difference]: With dead ends: 300 [2023-02-15 22:19:32,555 INFO L226 Difference]: Without dead ends: 300 [2023-02-15 22:19:32,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:19:32,555 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 253 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:19:32,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 390 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:19:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-02-15 22:19:32,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 286. [2023-02-15 22:19:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 265 states have (on average 1.2566037735849056) internal successors, (333), 285 states have internal predecessors, (333), 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) [2023-02-15 22:19:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 333 transitions. [2023-02-15 22:19:32,558 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 333 transitions. Word has length 36 [2023-02-15 22:19:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:19:32,559 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 333 transitions. [2023-02-15 22:19:32,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 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) [2023-02-15 22:19:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 333 transitions. [2023-02-15 22:19:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 22:19:32,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:19:32,560 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:19:32,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:19:32,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 22:19:32,765 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:19:32,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:19:32,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1824477449, now seen corresponding path program 1 times [2023-02-15 22:19:32,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:19:32,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244817598] [2023-02-15 22:19:32,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:32,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:19:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:33,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:19:33,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244817598] [2023-02-15 22:19:33,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244817598] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:19:33,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345108386] [2023-02-15 22:19:33,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:33,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:19:33,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:19:33,372 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) [2023-02-15 22:19:33,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:19:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:33,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 22:19:33,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:19:33,472 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,496 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,501 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,573 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:19:33,573 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:19:33,624 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:19:33,632 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:19:33,802 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,811 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:19:33,811 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,863 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:19:33,863 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:19:33,871 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,890 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:19:33,892 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:33,897 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:34,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:19:34,089 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:34,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:19:34,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:19:34,095 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 10 [2023-02-15 22:19:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:34,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:19:34,314 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_997 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_997) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_998 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-15 22:19:38,587 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:19:38,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:19:38,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2023-02-15 22:19:38,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:19:38,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:19:38,595 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 28 [2023-02-15 22:19:38,598 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:38,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:19:38,603 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:19:38,604 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 22:19:38,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-02-15 22:19:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:38,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345108386] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:19:38,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:19:38,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2023-02-15 22:19:38,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814324170] [2023-02-15 22:19:38,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:19:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 22:19:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:19:38,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 22:19:38,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=822, Unknown=27, NotChecked=60, Total=1056 [2023-02-15 22:19:38,654 INFO L87 Difference]: Start difference. First operand 286 states and 333 transitions. Second operand has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 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) [2023-02-15 22:19:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:19:45,870 INFO L93 Difference]: Finished difference Result 580 states and 657 transitions. [2023-02-15 22:19:45,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 22:19:45,871 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 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 36 [2023-02-15 22:19:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:19:45,873 INFO L225 Difference]: With dead ends: 580 [2023-02-15 22:19:45,873 INFO L226 Difference]: Without dead ends: 580 [2023-02-15 22:19:45,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=859, Invalid=3491, Unknown=76, NotChecked=130, Total=4556 [2023-02-15 22:19:45,875 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 864 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 134 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:19:45,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1460 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1783 Invalid, 37 Unknown, 199 Unchecked, 1.2s Time] [2023-02-15 22:19:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-02-15 22:19:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 314. [2023-02-15 22:19:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 293 states have (on average 1.2593856655290103) internal successors, (369), 313 states have internal predecessors, (369), 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) [2023-02-15 22:19:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 369 transitions. [2023-02-15 22:19:45,881 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 369 transitions. Word has length 36 [2023-02-15 22:19:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:19:45,881 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 369 transitions. [2023-02-15 22:19:45,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 33 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) [2023-02-15 22:19:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 369 transitions. [2023-02-15 22:19:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:19:45,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:19:45,882 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:19:45,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 22:19:46,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 22:19:46,090 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:19:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:19:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701986, now seen corresponding path program 1 times [2023-02-15 22:19:46,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:19:46,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515367991] [2023-02-15 22:19:46,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:19:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:46,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:19:46,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515367991] [2023-02-15 22:19:46,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515367991] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:19:46,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718258854] [2023-02-15 22:19:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:19:46,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:19:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:19:46,557 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) [2023-02-15 22:19:46,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:19:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:19:46,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 22:19:46,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:19:46,674 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:46,696 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:19:46,696 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:46,719 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:46,787 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:19:46,788 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:46,872 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-15 22:19:46,872 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:19:46,934 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:19:46,935 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 36 [2023-02-15 22:19:47,229 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:19:47,229 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 22:19:47,388 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:19:47,388 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 22:19:47,462 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:19:47,462 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 100 [2023-02-15 22:19:47,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 22:19:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:47,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:19:47,792 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2023-02-15 22:19:49,851 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array Int Int))) (= (select |c_#valid| (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_1117) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2023-02-15 22:19:49,934 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (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_17|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1117) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17|))))) is different from false [2023-02-15 22:19:49,945 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1111 (Array Int Int)) (|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|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_17| 1) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1111))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |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_1117) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1))) is different from false [2023-02-15 22:19:50,008 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:19:50,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2023-02-15 22:19:50,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:19:50,012 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 48 [2023-02-15 22:19:50,015 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 25 [2023-02-15 22:19:50,018 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 31 [2023-02-15 22:19:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:19:50,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718258854] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:19:50,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:19:50,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2023-02-15 22:19:50,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692123047] [2023-02-15 22:19:50,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:19:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-15 22:19:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:19:50,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-15 22:19:50,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=933, Unknown=21, NotChecked=268, Total=1406 [2023-02-15 22:19:50,160 INFO L87 Difference]: Start difference. First operand 314 states and 369 transitions. Second operand has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 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) [2023-02-15 22:20:05,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:20:08,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:20:10,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:20:12,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:20:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:13,442 INFO L93 Difference]: Finished difference Result 723 states and 829 transitions. [2023-02-15 22:20:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-02-15 22:20:13,443 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 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 [2023-02-15 22:20:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:13,444 INFO L225 Difference]: With dead ends: 723 [2023-02-15 22:20:13,444 INFO L226 Difference]: Without dead ends: 723 [2023-02-15 22:20:13,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=794, Invalid=3757, Unknown=21, NotChecked=540, Total=5112 [2023-02-15 22:20:13,445 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 710 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 98 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 3632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1108 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:13,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 2110 Invalid, 3632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 2418 Invalid, 8 Unknown, 1108 Unchecked, 9.6s Time] [2023-02-15 22:20:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2023-02-15 22:20:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 351. [2023-02-15 22:20:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 330 states have (on average 1.2575757575757576) internal successors, (415), 350 states have internal predecessors, (415), 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) [2023-02-15 22:20:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 415 transitions. [2023-02-15 22:20:13,454 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 415 transitions. Word has length 38 [2023-02-15 22:20:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:13,454 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 415 transitions. [2023-02-15 22:20:13,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5945945945945947) internal successors, (96), 38 states have internal predecessors, (96), 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) [2023-02-15 22:20:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 415 transitions. [2023-02-15 22:20:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:20:13,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:13,455 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:20:13,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:20:13,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:20:13,656 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:20:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1501701985, now seen corresponding path program 1 times [2023-02-15 22:20:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:13,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942687735] [2023-02-15 22:20:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:14,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:14,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942687735] [2023-02-15 22:20:14,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942687735] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:20:14,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249740147] [2023-02-15 22:20:14,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:14,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:20:14,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:20:14,554 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) [2023-02-15 22:20:14,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:20:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:14,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 22:20:14,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:20:14,694 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:14,739 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:14,752 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:20:14,753 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:14,791 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:14,800 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:14,888 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:20:14,889 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:14,895 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:14,986 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-15 22:20:14,986 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:14,994 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:15,041 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:15,054 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,232 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:20:15,233 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:15,239 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,320 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:20:15,320 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:15,328 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,360 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:20:15,360 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,366 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 27 [2023-02-15 22:20:15,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:15,684 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:15,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:15,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 22:20:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:15,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:20:15,827 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1244 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1244) |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_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0)))))) is different from false [2023-02-15 22:20:16,010 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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|))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1245 (Array Int Int)) (v_ArrVal_1244 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4) (select |c_#length| (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_1245) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_1244 (Array Int Int))) (<= 0 (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2023-02-15 22:20:20,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:20,021 INFO L350 Elim1Store]: Elim1 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 96 treesize of output 87 [2023-02-15 22:20:20,024 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,026 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 138 [2023-02-15 22:20:20,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:20,033 INFO L350 Elim1Store]: Elim1 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 130 treesize of output 100 [2023-02-15 22:20:20,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,038 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 134 [2023-02-15 22:20:20,041 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,043 INFO L350 Elim1Store]: Elim1 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 54 [2023-02-15 22:20:20,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,049 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 48 [2023-02-15 22:20:20,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,053 INFO L350 Elim1Store]: Elim1 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 100 treesize of output 88 [2023-02-15 22:20:20,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,057 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 70 [2023-02-15 22:20:20,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:20,083 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 37 [2023-02-15 22:20:20,086 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,087 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 38 [2023-02-15 22:20:20,090 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,092 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 13 [2023-02-15 22:20:20,096 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:20,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:20:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:22,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249740147] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:20:22,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:20:22,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 40 [2023-02-15 22:20:22,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518892186] [2023-02-15 22:20:22,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:20:22,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 22:20:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:22,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 22:20:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1283, Unknown=30, NotChecked=150, Total=1640 [2023-02-15 22:20:22,280 INFO L87 Difference]: Start difference. First operand 351 states and 415 transitions. Second operand has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 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) [2023-02-15 22:20:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:32,069 INFO L93 Difference]: Finished difference Result 1104 states and 1266 transitions. [2023-02-15 22:20:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-02-15 22:20:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 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 [2023-02-15 22:20:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:32,072 INFO L225 Difference]: With dead ends: 1104 [2023-02-15 22:20:32,072 INFO L226 Difference]: Without dead ends: 1104 [2023-02-15 22:20:32,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 2591 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1472, Invalid=8202, Unknown=36, NotChecked=390, Total=10100 [2023-02-15 22:20:32,074 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 1461 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 3717 mSolverCounterSat, 162 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 3717 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 772 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:32,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 2852 Invalid, 4712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 3717 Invalid, 61 Unknown, 772 Unchecked, 3.1s Time] [2023-02-15 22:20:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2023-02-15 22:20:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 391. [2023-02-15 22:20:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 370 states have (on average 1.2567567567567568) internal successors, (465), 390 states have internal predecessors, (465), 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) [2023-02-15 22:20:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 465 transitions. [2023-02-15 22:20:32,085 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 465 transitions. Word has length 38 [2023-02-15 22:20:32,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:32,085 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 465 transitions. [2023-02-15 22:20:32,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 41 states have internal predecessors, (111), 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) [2023-02-15 22:20:32,086 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 465 transitions. [2023-02-15 22:20:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:20:32,086 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:32,086 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:20:32,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:20:32,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-02-15 22:20:32,287 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:20:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:32,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1790052731, now seen corresponding path program 1 times [2023-02-15 22:20:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:32,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090607975] [2023-02-15 22:20:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:32,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090607975] [2023-02-15 22:20:32,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090607975] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:20:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139880241] [2023-02-15 22:20:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:32,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:20:32,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:20:32,406 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) [2023-02-15 22:20:32,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:20:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:32,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 22:20:32,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:20:32,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:32,732 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:32,736 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:32,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:32,738 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:32,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:20:32,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:32,955 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 45 [2023-02-15 22:20:32,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:32,966 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 41 [2023-02-15 22:20:33,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:33,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139880241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:20:33,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:20:33,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2023-02-15 22:20:33,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872677458] [2023-02-15 22:20:33,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:20:33,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:20:33,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:20:33,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:20:33,196 INFO L87 Difference]: Start difference. First operand 391 states and 465 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 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) [2023-02-15 22:20:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:33,994 INFO L93 Difference]: Finished difference Result 461 states and 534 transitions. [2023-02-15 22:20:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:20:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 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 [2023-02-15 22:20:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:33,995 INFO L225 Difference]: With dead ends: 461 [2023-02-15 22:20:33,995 INFO L226 Difference]: Without dead ends: 461 [2023-02-15 22:20:33,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2023-02-15 22:20:33,996 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 486 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 52 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:33,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 859 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 842 Invalid, 3 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:20:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-02-15 22:20:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 410. [2023-02-15 22:20:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 389 states have (on average 1.2596401028277635) internal successors, (490), 409 states have internal predecessors, (490), 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) [2023-02-15 22:20:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 490 transitions. [2023-02-15 22:20:34,011 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 490 transitions. Word has length 38 [2023-02-15 22:20:34,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:34,011 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 490 transitions. [2023-02-15 22:20:34,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 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) [2023-02-15 22:20:34,011 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 490 transitions. [2023-02-15 22:20:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:20:34,012 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:34,012 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:20:34,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 22:20:34,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:20:34,220 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:20:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash -434794642, now seen corresponding path program 1 times [2023-02-15 22:20:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:34,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927350921] [2023-02-15 22:20:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:34,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927350921] [2023-02-15 22:20:34,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927350921] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:20:34,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299671929] [2023-02-15 22:20:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:34,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:20:34,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:20:34,678 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) [2023-02-15 22:20:34,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 22:20:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:34,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 22:20:34,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:20:34,801 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:34,821 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:34,858 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:20:34,859 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:34,890 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:20:34,890 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:35,026 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:20:35,026 INFO L350 Elim1Store]: Elim1 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 53 treesize of output 47 [2023-02-15 22:20:35,068 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:20:35,068 INFO L350 Elim1Store]: Elim1 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 53 treesize of output 47 [2023-02-15 22:20:35,092 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:20:35,092 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:35,140 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2023-02-15 22:20:35,140 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 46 [2023-02-15 22:20:35,321 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2023-02-15 22:20:35,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 119 [2023-02-15 22:20:35,403 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2023-02-15 22:20:35,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:20:35,479 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:35,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 161 [2023-02-15 22:20:47,629 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 72 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:20:47,923 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:47,924 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 36 [2023-02-15 22:20:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:47,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:20:48,139 INFO L321 Elim1Store]: treesize reduction 18, result has 71.4 percent of original size [2023-02-15 22:20:48,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 56 [2023-02-15 22:20:48,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:48,242 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 22:20:48,394 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2023-02-15 22:20:48,395 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 16 [2023-02-15 22:20:48,404 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_10 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1405 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_88| Int)) (let ((.cse1 (select v_arrayElimArr_10 (+ |v_ULTIMATE.start_main_~x~0#1.offset_88| 4)))) (let ((.cse0 (select (select (store (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_arrayElimArr_10) .cse1 v_ArrVal_1405) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (or (= .cse0 |c_ULTIMATE.start_main_#t~malloc7#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse1) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2023-02-15 22:20:48,538 INFO L321 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2023-02-15 22:20:48,538 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 57 [2023-02-15 22:20:48,540 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:20:48,544 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 22:20:48,544 INFO L350 Elim1Store]: Elim1 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 95 treesize of output 49 [2023-02-15 22:20:48,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:48,550 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2023-02-15 22:20:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:48,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299671929] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:20:48,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:20:48,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 43 [2023-02-15 22:20:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409899438] [2023-02-15 22:20:48,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:20:48,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 22:20:48,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:20:48,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 22:20:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1583, Unknown=26, NotChecked=82, Total=1892 [2023-02-15 22:20:48,594 INFO L87 Difference]: Start difference. First operand 410 states and 490 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) [2023-02-15 22:20:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:20:51,307 INFO L93 Difference]: Finished difference Result 597 states and 697 transitions. [2023-02-15 22:20:51,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 22:20:51,307 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 [2023-02-15 22:20:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:20:51,309 INFO L225 Difference]: With dead ends: 597 [2023-02-15 22:20:51,309 INFO L226 Difference]: Without dead ends: 597 [2023-02-15 22:20:51,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=711, Invalid=4231, Unknown=32, NotChecked=138, Total=5112 [2023-02-15 22:20:51,310 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 711 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 147 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:20:51,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1982 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 2382 Invalid, 2 Unknown, 181 Unchecked, 1.4s Time] [2023-02-15 22:20:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2023-02-15 22:20:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 417. [2023-02-15 22:20:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 396 states have (on average 1.255050505050505) internal successors, (497), 416 states have internal predecessors, (497), 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) [2023-02-15 22:20:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 497 transitions. [2023-02-15 22:20:51,316 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 497 transitions. Word has length 38 [2023-02-15 22:20:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:20:51,316 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 497 transitions. [2023-02-15 22:20:51,316 INFO L496 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) [2023-02-15 22:20:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 497 transitions. [2023-02-15 22:20:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:20:51,317 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:20:51,317 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:20:51,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:20:51,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-02-15 22:20:51,523 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:20:51,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:20:51,523 INFO L85 PathProgramCache]: Analyzing trace with hash -434794641, now seen corresponding path program 1 times [2023-02-15 22:20:51,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:20:51,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149581264] [2023-02-15 22:20:51,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:51,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:20:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:20:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149581264] [2023-02-15 22:20:52,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149581264] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:20:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719927211] [2023-02-15 22:20:52,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:20:52,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:20:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:20:52,303 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) [2023-02-15 22:20:52,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 22:20:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:20:52,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 22:20:52,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:20:52,437 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,470 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,475 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,552 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:20:52,552 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:52,594 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:52,602 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,762 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:20:52,762 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:52,766 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:52,810 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,816 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:20:52,817 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,835 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:20:52,836 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:52,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:52,890 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 22:20:52,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-02-15 22:20:52,900 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:53,059 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:20:53,060 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2023-02-15 22:20:53,065 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:53,070 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 12 [2023-02-15 22:20:53,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:53,226 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:53,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:20:53,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:53,231 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:20:53,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:20:53,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:53,577 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-15 22:20:53,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:20:53,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 98 [2023-02-15 22:20:53,833 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-15 22:20:53,845 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:53,857 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:20:53,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_1531 (Array Int Int)) (v_subst_3 Int)) (let ((.cse0 (select v_arrayElimArr_12 (+ v_subst_3 4)))) (or (= (select (select (store (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_arrayElimArr_12) .cse0 v_ArrVal_1531) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.base| .cse0)))) (forall ((v_ArrVal_1527 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_17| Int)) (or (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc10#1.base_17|) (= (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_1527) |v_ULTIMATE.start_main_#t~malloc10#1.base_17| v_ArrVal_1530) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 22:21:00,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:00,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:00,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2023-02-15 22:21:00,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:00,287 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:00,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-02-15 22:21:00,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:00,293 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2023-02-15 22:21:00,299 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:00,302 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 22:21:00,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2023-02-15 22:21:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:00,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719927211] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:00,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:21:00,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2023-02-15 22:21:00,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45170107] [2023-02-15 22:21:00,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:00,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 22:21:00,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 22:21:00,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1777, Unknown=55, NotChecked=88, Total=2162 [2023-02-15 22:21:00,356 INFO L87 Difference]: Start difference. First operand 417 states and 497 transitions. Second operand has 47 states, 47 states have (on average 2.25531914893617) internal successors, (106), 47 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) [2023-02-15 22:21:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:03,786 INFO L93 Difference]: Finished difference Result 603 states and 699 transitions. [2023-02-15 22:21:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-15 22:21:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.25531914893617) internal successors, (106), 47 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 [2023-02-15 22:21:03,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:03,788 INFO L225 Difference]: With dead ends: 603 [2023-02-15 22:21:03,788 INFO L226 Difference]: Without dead ends: 603 [2023-02-15 22:21:03,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1005, Invalid=5264, Unknown=55, NotChecked=156, Total=6480 [2023-02-15 22:21:03,790 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 806 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 2753 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 269 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:03,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1836 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2753 Invalid, 0 Unknown, 269 Unchecked, 1.7s Time] [2023-02-15 22:21:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2023-02-15 22:21:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 424. [2023-02-15 22:21:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 403 states have (on average 1.2555831265508686) internal successors, (506), 423 states have internal predecessors, (506), 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) [2023-02-15 22:21:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 506 transitions. [2023-02-15 22:21:03,795 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 506 transitions. Word has length 38 [2023-02-15 22:21:03,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:03,795 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 506 transitions. [2023-02-15 22:21:03,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.25531914893617) internal successors, (106), 47 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) [2023-02-15 22:21:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 506 transitions. [2023-02-15 22:21:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:21:03,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:03,796 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:21:03,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:04,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-02-15 22:21:04,002 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:21:04,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash 342939421, now seen corresponding path program 1 times [2023-02-15 22:21:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:04,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251594350] [2023-02-15 22:21:04,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:04,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:21:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:04,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251594350] [2023-02-15 22:21:04,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251594350] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:21:04,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148694238] [2023-02-15 22:21:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:04,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:04,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:04,115 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) [2023-02-15 22:21:04,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 22:21:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:04,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:21:04,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:04,316 INFO L350 Elim1Store]: Elim1 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 14 [2023-02-15 22:21:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:21:04,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:21:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:21:04,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148694238] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:04,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:21:04,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-02-15 22:21:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769589977] [2023-02-15 22:21:04,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:04,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:21:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:21:04,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:21:04,390 INFO L87 Difference]: Start difference. First operand 424 states and 506 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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) [2023-02-15 22:21:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:04,482 INFO L93 Difference]: Finished difference Result 430 states and 511 transitions. [2023-02-15 22:21:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:21:04,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 [2023-02-15 22:21:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:04,484 INFO L225 Difference]: With dead ends: 430 [2023-02-15 22:21:04,484 INFO L226 Difference]: Without dead ends: 400 [2023-02-15 22:21:04,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:21:04,485 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:04,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 232 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:21:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-02-15 22:21:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2023-02-15 22:21:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 379 states have (on average 1.266490765171504) internal successors, (480), 399 states have internal predecessors, (480), 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) [2023-02-15 22:21:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 480 transitions. [2023-02-15 22:21:04,489 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 480 transitions. Word has length 39 [2023-02-15 22:21:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:04,489 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 480 transitions. [2023-02-15 22:21:04,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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) [2023-02-15 22:21:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 480 transitions. [2023-02-15 22:21:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:21:04,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:04,490 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:21:04,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:04,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-02-15 22:21:04,695 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:21:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1235381073, now seen corresponding path program 1 times [2023-02-15 22:21:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:04,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083743663] [2023-02-15 22:21:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:05,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:05,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083743663] [2023-02-15 22:21:05,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083743663] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:21:05,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403878567] [2023-02-15 22:21:05,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:05,241 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:21:05,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 22:21:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:05,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 22:21:05,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:05,396 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,408 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,419 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:21:05,419 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,427 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,432 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,447 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 8 [2023-02-15 22:21:05,455 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,507 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:21:05,507 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,536 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:05,544 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,578 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,624 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,641 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,663 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,710 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:05,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:21:06,082 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:21:06,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-02-15 22:21:06,179 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 15 [2023-02-15 22:21:06,180 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:06,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403878567] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:06,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:21:06,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2023-02-15 22:21:06,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988078992] [2023-02-15 22:21:06,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:06,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 22:21:06,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 22:21:06,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=849, Unknown=4, NotChecked=0, Total=992 [2023-02-15 22:21:06,198 INFO L87 Difference]: Start difference. First operand 400 states and 480 transitions. Second operand has 32 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 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) [2023-02-15 22:21:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:07,280 INFO L93 Difference]: Finished difference Result 531 states and 623 transitions. [2023-02-15 22:21:07,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 22:21:07,281 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 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 [2023-02-15 22:21:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:07,282 INFO L225 Difference]: With dead ends: 531 [2023-02-15 22:21:07,282 INFO L226 Difference]: Without dead ends: 531 [2023-02-15 22:21:07,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=508, Invalid=2244, Unknown=4, NotChecked=0, Total=2756 [2023-02-15 22:21:07,284 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 593 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:07,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1215 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:21:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-02-15 22:21:07,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 419. [2023-02-15 22:21:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 398 states have (on average 1.2537688442211055) internal successors, (499), 418 states have internal predecessors, (499), 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) [2023-02-15 22:21:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 499 transitions. [2023-02-15 22:21:07,290 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 499 transitions. Word has length 40 [2023-02-15 22:21:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:07,291 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 499 transitions. [2023-02-15 22:21:07,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.40625) internal successors, (77), 32 states have internal predecessors, (77), 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) [2023-02-15 22:21:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 499 transitions. [2023-02-15 22:21:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:21:07,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:07,292 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:21:07,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:07,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-02-15 22:21:07,497 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:21:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1860360063, now seen corresponding path program 1 times [2023-02-15 22:21:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:07,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086102919] [2023-02-15 22:21:07,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:07,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:08,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086102919] [2023-02-15 22:21:08,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086102919] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:21:08,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680963654] [2023-02-15 22:21:08,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:08,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:08,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:08,120 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:21:08,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 22:21:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:08,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 22:21:08,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:08,256 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,283 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,287 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,352 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:21:08,352 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:08,388 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:08,394 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:08,557 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,565 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:08,565 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,608 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:08,608 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:08,613 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,634 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:21:08,634 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:08,686 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2023-02-15 22:21:08,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-02-15 22:21:08,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:08,695 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 23 [2023-02-15 22:21:08,817 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-15 22:21:08,818 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2023-02-15 22:21:08,823 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:08,826 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 12 [2023-02-15 22:21:09,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:09,012 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:09,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:09,015 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:09,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:21:09,086 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_1824 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1824) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1825 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2023-02-15 22:21:09,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:09,214 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2023-02-15 22:21:09,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:09,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 98 [2023-02-15 22:21:09,506 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:09,512 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 12 [2023-02-15 22:21:09,520 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_arrayElimArr_15 (Array Int Int)) (v_subst_4 Int) (v_ArrVal_1825 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_15 (+ v_subst_4 4)))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| .cse0) (= (select (select (store (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_arrayElimArr_15) .cse0 v_ArrVal_1825) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)))) (forall ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1822 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc10#1.base_22| Int)) (or (= (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_1822) |v_ULTIMATE.start_main_#t~malloc10#1.base_22| v_ArrVal_1824) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.offset|) (= |v_ULTIMATE.start_main_#t~malloc10#1.base_22| |c_ULTIMATE.start_main_~x~0#1.base|))))) is different from false [2023-02-15 22:21:14,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:14,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:14,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2023-02-15 22:21:14,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:14,850 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:14,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 30 [2023-02-15 22:21:14,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:14,855 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2023-02-15 22:21:14,861 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:14,864 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 22:21:14,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 1 [2023-02-15 22:21:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:14,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680963654] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:14,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:21:14,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 43 [2023-02-15 22:21:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555147623] [2023-02-15 22:21:14,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:14,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-15 22:21:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-15 22:21:14,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1391, Unknown=29, NotChecked=158, Total=1806 [2023-02-15 22:21:14,913 INFO L87 Difference]: Start difference. First operand 419 states and 499 transitions. Second operand has 43 states, 43 states have (on average 2.627906976744186) internal successors, (113), 43 states have internal predecessors, (113), 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) [2023-02-15 22:21:19,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:19,286 INFO L93 Difference]: Finished difference Result 549 states and 643 transitions. [2023-02-15 22:21:19,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 22:21:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.627906976744186) internal successors, (113), 43 states have internal predecessors, (113), 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 [2023-02-15 22:21:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:19,288 INFO L225 Difference]: With dead ends: 549 [2023-02-15 22:21:19,288 INFO L226 Difference]: Without dead ends: 549 [2023-02-15 22:21:19,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=647, Invalid=3114, Unknown=29, NotChecked=242, Total=4032 [2023-02-15 22:21:19,290 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 509 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 110 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 479 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:19,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1498 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1849 Invalid, 7 Unknown, 479 Unchecked, 1.4s Time] [2023-02-15 22:21:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2023-02-15 22:21:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 414. [2023-02-15 22:21:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 393 states have (on average 1.2544529262086515) internal successors, (493), 413 states have internal predecessors, (493), 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) [2023-02-15 22:21:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 493 transitions. [2023-02-15 22:21:19,294 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 493 transitions. Word has length 40 [2023-02-15 22:21:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:19,294 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 493 transitions. [2023-02-15 22:21:19,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.627906976744186) internal successors, (113), 43 states have internal predecessors, (113), 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) [2023-02-15 22:21:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 493 transitions. [2023-02-15 22:21:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:21:19,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:19,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:19,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:19,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:19,495 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:21:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:19,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1671753086, now seen corresponding path program 1 times [2023-02-15 22:21:19,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:19,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731557276] [2023-02-15 22:21:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:19,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:19,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:19,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731557276] [2023-02-15 22:21:19,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731557276] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:21:19,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979269099] [2023-02-15 22:21:19,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:19,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:19,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:19,760 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:21:19,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 22:21:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:19,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 22:21:19,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:19,903 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:19,967 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:21:19,968 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:20,004 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:20,076 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:20,076 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:20,111 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:20,111 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:20,131 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:20,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 22:21:20,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:20,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 22:21:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:20,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:21:20,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:20,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-02-15 22:21:20,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:20,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2023-02-15 22:21:20,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-02-15 22:21:24,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:24,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979269099] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:24,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:21:24,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2023-02-15 22:21:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632106164] [2023-02-15 22:21:24,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:24,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 22:21:24,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:24,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 22:21:24,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=738, Unknown=4, NotChecked=0, Total=870 [2023-02-15 22:21:24,828 INFO L87 Difference]: Start difference. First operand 414 states and 493 transitions. Second operand has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 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) [2023-02-15 22:21:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:25,811 INFO L93 Difference]: Finished difference Result 595 states and 686 transitions. [2023-02-15 22:21:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:21:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 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 [2023-02-15 22:21:25,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:25,830 INFO L225 Difference]: With dead ends: 595 [2023-02-15 22:21:25,830 INFO L226 Difference]: Without dead ends: 595 [2023-02-15 22:21:25,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=278, Invalid=1200, Unknown=4, NotChecked=0, Total=1482 [2023-02-15 22:21:25,831 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 751 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:25,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1113 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:21:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-02-15 22:21:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 450. [2023-02-15 22:21:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.2470862470862472) internal successors, (535), 449 states have internal predecessors, (535), 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) [2023-02-15 22:21:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 535 transitions. [2023-02-15 22:21:25,840 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 535 transitions. Word has length 40 [2023-02-15 22:21:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:25,840 INFO L495 AbstractCegarLoop]: Abstraction has 450 states and 535 transitions. [2023-02-15 22:21:25,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 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) [2023-02-15 22:21:25,840 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 535 transitions. [2023-02-15 22:21:25,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 22:21:25,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:25,858 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:21:25,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:26,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-02-15 22:21:26,059 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:21:26,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1671753085, now seen corresponding path program 1 times [2023-02-15 22:21:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:26,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423966498] [2023-02-15 22:21:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423966498] [2023-02-15 22:21:26,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423966498] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:21:26,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182081487] [2023-02-15 22:21:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:26,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:26,431 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:21:26,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 22:21:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:26,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 22:21:26,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:26,578 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,620 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:21:26,621 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,624 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,645 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,650 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,714 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:26,715 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:26,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:21:26,746 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:21:26,746 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-15 22:21:26,748 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-15 22:21:26,776 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:26,777 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,800 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:26,800 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 22:21:26,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:26,920 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:26,925 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:26,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:26,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2023-02-15 22:21:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:26,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:21:27,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:27,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-02-15 22:21:27,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:27,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2023-02-15 22:21:27,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-02-15 22:21:27,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:27,461 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 38 [2023-02-15 22:21:27,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:27,465 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2023-02-15 22:21:27,467 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:27,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:27,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:27,470 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 19 [2023-02-15 22:21:27,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:27,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:27,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:21:27,474 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 12 [2023-02-15 22:21:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:27,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182081487] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:27,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:21:27,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2023-02-15 22:21:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954977226] [2023-02-15 22:21:27,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:27,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 22:21:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 22:21:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=768, Unknown=5, NotChecked=0, Total=870 [2023-02-15 22:21:27,636 INFO L87 Difference]: Start difference. First operand 450 states and 535 transitions. Second operand has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 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) [2023-02-15 22:21:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:28,763 INFO L93 Difference]: Finished difference Result 580 states and 670 transitions. [2023-02-15 22:21:28,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:21:28,763 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 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 [2023-02-15 22:21:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:28,764 INFO L225 Difference]: With dead ends: 580 [2023-02-15 22:21:28,765 INFO L226 Difference]: Without dead ends: 580 [2023-02-15 22:21:28,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=340, Invalid=1725, Unknown=5, NotChecked=0, Total=2070 [2023-02-15 22:21:28,765 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 892 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:28,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1082 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:21:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2023-02-15 22:21:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 475. [2023-02-15 22:21:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 454 states have (on average 1.2444933920704846) internal successors, (565), 474 states have internal predecessors, (565), 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) [2023-02-15 22:21:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 565 transitions. [2023-02-15 22:21:28,781 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 565 transitions. Word has length 40 [2023-02-15 22:21:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:28,783 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 565 transitions. [2023-02-15 22:21:28,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 30 states have internal predecessors, (115), 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) [2023-02-15 22:21:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 565 transitions. [2023-02-15 22:21:28,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:21:28,789 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:28,796 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:21:28,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:29,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-02-15 22:21:29,002 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:21:29,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:29,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1015163354, now seen corresponding path program 1 times [2023-02-15 22:21:29,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:29,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123537543] [2023-02-15 22:21:29,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:29,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:29,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:29,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123537543] [2023-02-15 22:21:29,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123537543] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:29,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:21:29,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:21:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180087766] [2023-02-15 22:21:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:29,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:21:29,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:21:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:21:29,228 INFO L87 Difference]: Start difference. First operand 475 states and 565 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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) [2023-02-15 22:21:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:29,516 INFO L93 Difference]: Finished difference Result 500 states and 589 transitions. [2023-02-15 22:21:29,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:21:29,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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 41 [2023-02-15 22:21:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:29,517 INFO L225 Difference]: With dead ends: 500 [2023-02-15 22:21:29,517 INFO L226 Difference]: Without dead ends: 495 [2023-02-15 22:21:29,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:21:29,518 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 250 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:29,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 356 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:21:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-02-15 22:21:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 471. [2023-02-15 22:21:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 450 states have (on average 1.2444444444444445) internal successors, (560), 470 states have internal predecessors, (560), 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) [2023-02-15 22:21:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 560 transitions. [2023-02-15 22:21:29,522 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 560 transitions. Word has length 41 [2023-02-15 22:21:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:29,522 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 560 transitions. [2023-02-15 22:21:29,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 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) [2023-02-15 22:21:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 560 transitions. [2023-02-15 22:21:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 22:21:29,523 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:29,523 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:21:29,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-02-15 22:21:29,523 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:21:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash 545888581, now seen corresponding path program 1 times [2023-02-15 22:21:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:29,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989565379] [2023-02-15 22:21:29,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:29,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:29,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:29,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989565379] [2023-02-15 22:21:29,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989565379] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:21:29,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820632236] [2023-02-15 22:21:29,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:29,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:29,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:29,788 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:21:29,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 22:21:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:29,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:21:29,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:29,986 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:30,003 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:21:30,004 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:30,015 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:30,033 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:30,043 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 8 [2023-02-15 22:21:30,049 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:30,160 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:21:30,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:21:30,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820632236] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:21:30,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:21:30,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 13 [2023-02-15 22:21:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982056677] [2023-02-15 22:21:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:21:30,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:21:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:21:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:21:30,162 INFO L87 Difference]: Start difference. First operand 471 states and 560 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) 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) [2023-02-15 22:21:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:21:30,585 INFO L93 Difference]: Finished difference Result 495 states and 584 transitions. [2023-02-15 22:21:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:21:30,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) 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 [2023-02-15 22:21:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:21:30,587 INFO L225 Difference]: With dead ends: 495 [2023-02-15 22:21:30,587 INFO L226 Difference]: Without dead ends: 495 [2023-02-15 22:21:30,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:21:30,588 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 224 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:21:30,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 435 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:21:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-02-15 22:21:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 479. [2023-02-15 22:21:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 458 states have (on average 1.24235807860262) internal successors, (569), 478 states have internal predecessors, (569), 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) [2023-02-15 22:21:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 569 transitions. [2023-02-15 22:21:30,591 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 569 transitions. Word has length 42 [2023-02-15 22:21:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:21:30,592 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 569 transitions. [2023-02-15 22:21:30,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) 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) [2023-02-15 22:21:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 569 transitions. [2023-02-15 22:21:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 22:21:30,592 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:21:30,592 INFO L195 NwaCegarLoop]: 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] [2023-02-15 22:21:30,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:21:30,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:30,799 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 63 more)] === [2023-02-15 22:21:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:21:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1248860378, now seen corresponding path program 1 times [2023-02-15 22:21:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:21:30,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172986091] [2023-02-15 22:21:30,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:21:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:31,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:21:31,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172986091] [2023-02-15 22:21:31,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172986091] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:21:31,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139267706] [2023-02-15 22:21:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:21:31,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:21:31,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:21:31,345 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:21:31,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 22:21:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:21:31,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 22:21:31,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:21:31,513 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:31,548 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:21:31,548 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:31,587 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:31,646 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:31,646 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:31,749 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-15 22:21:31,750 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:31,816 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:21:31,816 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 36 [2023-02-15 22:21:32,084 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:32,084 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 84 [2023-02-15 22:21:32,195 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:21:32,195 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 84 [2023-02-15 22:21:32,295 INFO L321 Elim1Store]: treesize reduction 86, result has 41.9 percent of original size [2023-02-15 22:21:32,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 108 treesize of output 154 [2023-02-15 22:21:32,460 INFO L321 Elim1Store]: treesize reduction 64, result has 21.0 percent of original size [2023-02-15 22:21:32,460 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 77 [2023-02-15 22:21:32,797 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2023-02-15 22:21:32,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 194 [2023-02-15 22:21:32,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:21:33,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:33,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 274 treesize of output 263 [2023-02-15 22:21:33,116 INFO L350 Elim1Store]: Elim1 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 14 [2023-02-15 22:21:38,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 22:21:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:38,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:21:38,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2256 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2256) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) 1)) is different from false [2023-02-15 22:21:39,035 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:39,035 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2023-02-15 22:21:41,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:21:41,883 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 56 [2023-02-15 22:21:41,885 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:41,886 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:21:41,887 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 62 [2023-02-15 22:21:41,891 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 67 [2023-02-15 22:21:41,896 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:21:41,913 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 40 [2023-02-15 22:21:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:21:42,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139267706] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:21:42,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:21:42,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 44 [2023-02-15 22:21:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652082076] [2023-02-15 22:21:42,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:21:42,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 22:21:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:21:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 22:21:42,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1631, Unknown=23, NotChecked=84, Total=1980 [2023-02-15 22:21:42,927 INFO L87 Difference]: Start difference. First operand 479 states and 569 transitions. Second operand has 45 states, 44 states have (on average 2.3863636363636362) internal successors, (105), 45 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) [2023-02-15 22:21:49,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 22:21:52,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]